On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography

The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj

• Type: Journal
• Year: 2010
• Where: ECCC
• Authors: Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, Alexander Smal
• Keywords: Algorithm, ECCC 2010, Hardware, Heuristic Acceptors, Polynomial-time Samplable Distribution