On an optimal quantified propositional proof system and a complete language for NP . . . (1997)
| Venue: | In Proceedings of the 11th International Symposium on Fundamentals of Computing Theory, LNCS #1279 |
| Citations: | 5 - 0 self |
BibTeX
@INPROCEEDINGS{Sadowski97onan,
author = {Zenon Sadowski},
title = {On an optimal quantified propositional proof system and a complete language for NP . . .},
booktitle = {In Proceedings of the 11th International Symposium on Fundamentals of Computing Theory, LNCS #1279},
year = {1997},
pages = {423--428},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. In this paper we prove that if there exists an optimal quantified propositional proof system then there exists a complete language for NP " co-NP. 1 Introduction There is a lot of activity around the complexity of propositional proof systems (see [7, 12]). Research into propositional proof systems is motivated by the open problem NP=co-NP? Research into quantified propositional proof systems is not so popular. The study of quantified propositional proof systems may be related to the problem NP=PSPACE? Some deep results about connections between quantified propositional proof systems and bounded arithmetic are contained in [8]. We propose to study the problem of the existence of an optimal quantified propositional proof system. The similar problem for propositional proof systems has been studied in [9]. It is not known whether complete languages exist for NP " co-NP and Sipser has shown in [10] that there are relativizations so that NP " co-NP has no complete languages (see also [4...
