Computer Science – Computational Complexity
Scientific paper
2009-08-19
Computer Science
Computational Complexity
11 pages, accepted to STACS 2010
Scientific paper
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. Krajicek and Pudlak (1989) show that this question is equivalent to the existence of an algorithm that is optimal on all propositional tautologies. Monroe (2009) recently gave a conjecture implying that such algorithm does not exist. We show that in the presence of errors such optimal algorithms do exist. The concept is motivated by the notion of heuristic algorithms. Namely, we allow the algorithm to claim a small number of false "theorems" (according to any samplable distribution on non-tautologies) and err with bounded probability on other inputs. Our result can also be viewed as the existence of an optimal proof system in a class of proof systems obtained by generalizing automatizable proof systems.
Hirsch Edward A.
Itsykson Dmitry
No associations
LandOfFree
On optimal heuristic randomized semidecision procedures, with application to proof complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On optimal heuristic randomized semidecision procedures, with application to proof complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On optimal heuristic randomized semidecision procedures, with application to proof complexity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-216205