scientific article; zbMATH DE number 8776

zbMATH Open0744.68053MaRDI QIDQ3971264FDOQ3971264

Authors: Richard Chang, Pankaj Rohatgi 

Publication date: 25 June 1992

Title of this publication is not available (Why is that?)

Recommendations

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

Mathematics Subject Classification ID

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

Cited In (8)

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

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)