Optimal acceptors and optimal proof systems

DOI10.1007/978-3-642-13562-0_4MaRDI QIDQ3569061zbMATH OpenOpenAlexFDO

Authors Edward A. Hirsch

Publication date 17 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13562-0_4

zbMATH Keywords

survey paper

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of proofs (03F20)

Cited in

(10)

• Efficient rational proofs with strong utility-gap guarantees
• Optimal heuristic algorithms for the image of an injective function
• Propositional proof systems and fast consistency provers
• Optimal Proximity Proofs Revisited
• On optimal inverters
• On an optimal randomized acceptor for graph nonisomorphism
• scientific article; zbMATH DE number 1304339 (Why is no real title available?)
• OPTIMAL PROOFS OF DETERMINACY II
• scientific article; zbMATH DE number 5201477 (Why is no real title available?)
• On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography

This page was built for publication: Optimal acceptors and optimal proof systems

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