On optimal heuristic randomized semidecision procedures, with application to proof complexity - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

On optimal heuristic randomized semidecision procedures, with application to proof complexity

Résumé

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.
Fichier principal
Vignette du fichier
hirsch.pdf (197.13 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00455819 , version 1 (11-02-2010)

Identifiants

  • HAL Id : inria-00455819 , version 1

Citer

Edward A. Hirsch, Dmitry Itsykson. On optimal heuristic randomized semidecision procedures, with application to proof complexity. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.453-464. ⟨inria-00455819⟩

Collections

STACS2010
47 Consultations
71 Téléchargements

Partager

Gmail Facebook X LinkedIn More