Some connections between presentability of complexity classes and the power of formal systems of reasoning-Reference-Cited by-同舟云学术

Some connections between presentability of complexity classes and the power of formal systems of reasoning

Published: Issue: Volume: Page:364-369
ISSN:
Container-title:Mathematical Foundations of Computer Science 1984
language:
Short-container-title:

Author:

Kowalczyk Wojciech

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0030318.pdf

Reference5 articles.

1. Hartmanis, J. and Hopcroft, J., Independence results in computer science, SIGACT News, vol. 8, no. 4 /1976/ pp. 13–24.

2. Hartmanis, J., Relations between diagonalization, proof systems, and complexity gaps, Theoretical Computer Science 8 /1979/ 239–253.

3. Landweber, L., Lipton, R., and Robertson, E., On the structure of sets in NP and other complexity classes, Theoretical Computer Science 15 /1981/ 181–200.

4. Schöning, U., A uniform approach to obtain diagonal sets in complexity classes, Theoretical Computer Science 18 /1982/ 95–103.

5. Sipser, M., On relativization and the existence of complete sets, 9th International Colloquium on Automata, Languages and Programing, Springer-Verlag, 1982.

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

1. A Parameterized Halting Problem;The Multivariate Algorithmic Revolution and Beyond;2012

2. On Complete Problems, Relativizations and Logics for Complexity Classes;Fields of Logic and Computation;2010

3. Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes;Computer Science - Theory and Applications;2009

4. On an optimal propositional proof system and the structure of easy subsets of TAUT;Theoretical Computer Science;2002-10

5. An unambiguous class possessing a complete set;Lecture Notes in Computer Science;1997