scientific article; zbMATH DE number 1335888

MaRDI QIDQ4258579zbMATH OpenFDO

Authors Jochen Messner, Johannes Köbler

Publication date 4 May 2000

zbMATH Keywords

proof systems

Mathematics Subject Classification ID

Recommendations

• Optimal proof systems imply complete sets for promise classes
• Do there exist complete sets for promise classes?
• Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
• scientific article; zbMATH DE number 1136087

Cited in

(10)

• Optimal proof systems imply complete sets for promise classes
• On an optimal propositional proof system and the structure of easy subsets of TAUT.
• Total nondeterministic Turing machines and a p-optimal proof system for SAT
• A Parameterized Halting Problem
• Do there exist complete sets for promise classes?
• scientific article; zbMATH DE number 3877090 (Why is no real title available?)
• Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
• scientific article; zbMATH DE number 874695 (Why is no real title available?)
• An unambiguous class possessing a complete set
• Hard instances of algorithms and proof systems

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 Q4258579)