Disjoint NP-pairs

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2003, Pages 313-332

  Glaßer, Christian ^a,b   Selman, Alan L ^a   Sengupta, Samik ^a   Zhang, Liyu ^a  

^a State University of New York   (United States)

^b UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; OPTIMIZATION; PUBLIC KEY CRYPTOGRAPHY; CALCULATIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; PARTICLE SEPARATORS;

DISJOINT PAIRS;

SET THEORY; OPTIMIZATION;

CALCULUS; DISJOINT NP-PAIRS; NONSYMMETRIC; NP-HARD; PROOF SYSTEM;

EID: 4944260523     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. [BDG98] S. Ben-David and A. Gringauze. On the existence of propositional proof systems and oracle-relativized propositional logic. Technical Report 5, Electronic Colloquium on Computational Complexity, 1998.
2. [BFFvM00] H. Buhrman, S. Fenner, L. Fortnow, and D. van Melkebeek. Optimal proof systems and sparse sets. In Proceedings 17th Symposium on Theoretical Aspects of Computer Science, volume 1770 of Lecture Notes in Computer Science, pages 407-418. Springer Verlag, 2000.
3. [BGS75] T. Baker, J. Gill, and R. Solovay. Relativizations of the P=NP problem. SIAM Journal on Computing, 4:431-442, 1975.
4. [CR79] S. Cook and R. Reckhow. The relative efficiency of propositional proof systems. Journal of Symbolic Logic, 44:36-50, 1979.
5. [ESY84] S. Even, A. Selman, and J. Yacobi. The complexity of promise problems with applications to public-key cryptography. Information and Control, 61:159-173, 1984.
6. [FHOS97] S. Fenner, S. Homer, M. Ogihara, and A. Selman. Oracles that compute values. SIAM Journal on Computing, 26:1043-1065, 1997.
7. [FPS01] L. Fortnow, A. Pavan, and A. Selman. Distributionally hard languages. Theory of Computing Systems, 34:245-261, 2001.
8. [GS88] J. Grollmann and A. Selman. Complexity measures for public-key cryptosystems. SIAM Journal on Computing, 17(2):309-335, 1988.
9. [Gur83] Y. Gurevich. Algebras of feasible functions. In Proceedings of the 24th Annual Symposium on Foundations of Computer Science, pages 210-214. IEEE Computer Society Press, 1983.
10. [GW03] C. Glaßer and G. Wechsung. Relativizing function classes. Journal of Universal Computer Science, 9(1):34-50, 2003.
11. [HIS85] J. Hartmanis, N. Immerman, and V. Sewelson. Sparse sets in NP - P: EXPTIME versus NEXPTIME. Information and Control, 65:158-181, 1985.
12. [HJV93] L. Hemaspaandra, S. Jain, and N. Vereshchagin. Banishing robust Turing completeness. International Journal of Foundations of Computer Science, 3-4:245-265, 1993.
13. [HS92] S. Homer and A. Selman. Oracles for structural properties: The isomorphism problem and public-key cryptography. Journal of Computer and System Sciences, 44(2):287-301, 1992.
14. [HY84] J. Hartmanis and Y. Yesha. Computation times of NP sets of different densities. Theoretical Computer Science, 34:17-32, 1984.
15. [KM00] Johannes Köbler and Jochen Messner. Is the standard proof system for sat p-optimal? In Proceedings of the 20th Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 1974 of Lecture Notes in Computer Science, pages 361-372. Springer Verlag, 2000.
16. [KMT] J. Köbler, J. Messner, and J. Torán. Optimal proof systems imply complete sets for promise classes. Information and Computation. To appear.
17. [KP89] J. Krajíček and P. Pudlák. Prepositional proof systems, the consistency of first order theories and the complexity of computations. Journal of Symbolic Logic, 54:1063-1079, 1989.
18. [MT98] J. Meßner and J. Torán. Optimal proof systems for propositional logic and complete sets. In Proceedings 15th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, pages 477-487. Springer Verlag, 1998.
19. [PS01] A. Pavan and A. Selman. Separation of NP-completeness notions. In Proceedings 16th IEEE Conference on Computational Complexity. IEEE Computer Society, 2001.
20. [Pud86] P. Pudlák. On the length of proofs of finitistic consistency statements in first order theories. In J. B. Paris et al., editor, Logic Colloquium '84, pages 165-196. North-Holland Amsterdam, 1986.
21. [Pud01] P. Pudlák. On reducibility and symmetry of disjoint NP-pairs. In Proceedings 26th International Symposium on Mathematical Foundations of Computer Science, volume 2136 of Lecture Notes in Computer Science, pages 621-632. Springer-Verlag, Berlin, 2001.
22. [Raz94] A. Razborov. On provably disjoint NP-pairs. Technical Report TR94-006, Electronic Colloquium on Computational Complexity, 1994.
23. [Sel79] A. Selman. P-selective sets, tally languages, and the behavior of polynomial-time reducibilities on NP. Mathematical Systems Theory, 13:55-65, 1979.
24. [Sel88] A. Selman. Promise problems complete for complexity classes. Information and Computation, 78:87-98, 1988.
25. [Sel94] A. Selman. A taxonomy on complexity classes of functions. Journal of Computer and System Sciences, 48:357-381, 1994.