scientific article; zbMATH DE number 8776

MaRDI QIDQ3971264zbMATH OpenFDO

Authors Richard Chang, Pankaj Rohatgi

Publication date 25 June 1992

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• On unique satisfiability and the threshold behavior of randomized reductions
• On completeness under random reductions
• Saving queries with randomness

Cited in

(8)

• Complexity of unique list colorability
• Randomizing Reductions of Search Problems
• Unique Horn renaming and Unique 2-Satisfiability
• On unique satisfiability and the threshold behavior of randomized reductions
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• On the computational cost of disjunctive logic programming: Propositional case
• scientific article; zbMATH DE number 5596976 (Why is no real title available?)
• Is Valiant-Vazirani's isolation probability improvable?

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3971264)