Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes-Reference-Cited by-同舟云学术

Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes

Published:2009 Issue: Volume: Page:47-58
ISSN:0302-9743
Container-title:Computer Science - Theory and Applications
language:
Short-container-title:

Author:

Beyersdorff Olaf,Sadowski Zenon

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-03351-3_7

Reference20 articles.

1. Balcázar, J.L., Díaz, J., Gabarró, J.: Structural Complexity I. Springer, Heidelberg (1988)

2. Beyersdorff, O.: Classes of representable disjoint NP-pairs. Theoretical Computer Science 377(1-3), 93–109 (2007)

3. Beyersdorff, O., Köbler, J., Messner, J.: Nondeterministic functions and the existence of optimal proof systems. Theoretical Computer Science (in press)

4. Lecture Notes in Computer Science;O. Beyersdorff,2009

5. Cook, S.A.: Feasibly constructive proofs and the propositional calculus. In: Proc. 7th Annual ACM Symposium on Theory of Computing, pp. 83–97 (1975)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New relations and separations of conjectures about incompleteness in the finite domain;The Journal of Symbolic Logic;2021-11-22

2. Proof Complexity;ENCYCLOP MATH APPL;2019-03-25

3. On the computational complexity of finding hard tautologies;Bulletin of the London Mathematical Society;2013-10-06

4. Do there exist complete sets for promise classes?;Mathematical Logic Quarterly;2011-06-16

5. Proof system representations of degrees of disjoint NP-pairs;Information Processing Letters;2011-03