scientific article; zbMATH DE number 1738671

MaRDI QIDQ4530008zbMATH OpenFDO

Authors Zenon Sadowski

Publication date 7 May 2002

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

Mathematics Subject Classification ID

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

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

Cited in

(8)

• Optimal proof systems imply complete sets for promise classes
• A remark on pseudo proof systems and hard instances of the satisfiability problem
• Knowledge compilation languages as proof systems
• On an optimal propositional proof system and the structure of easy subsets of TAUT.
• scientific article; zbMATH DE number 2080216 (Why is no real title available?)
• scientific article; zbMATH DE number 1929970 (Why is no real title available?)
• scientific article; zbMATH DE number 5201477 (Why is no real title available?)
• Total nondeterministic Turing machines and a p-optimal proof system for SAT

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)