scientific article; zbMATH DE number 1738671

zbMATH Open0984.03045MaRDI QIDQ4530008FDOQ4530008

Authors: Zenon Sadowski 

Publication date: 7 May 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2055/20550300

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

Recommendations

• scientific article; zbMATH DE number 2080216
• 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
• scientific article; zbMATH DE number 1136087
• scientific article; zbMATH DE number 5201477

Mathematics Subject Classification ID

Complexity of proofs (03F20) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Total nondeterministic Turing machines and a p-optimal proof system for SAT
• Optimal proof systems imply complete sets for promise classes
• On an optimal propositional proof system and the structure of easy subsets of TAUT.
• Knowledge compilation languages as proof systems
• A remark on pseudo proof systems and hard instances of the satisfiability problem

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