Reductions between disjoint NP-pairs

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 19, Issue , 2004, Pages 42-53

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

^a UNIVERSITY OF WÜRZBURG   (Germany)

^b State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LEXICOGRAPHY; SMART REDUCTION; TURING REDUCTION;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; ITERATIVE METHODS; MATHEMATICAL OPERATORS; SET THEORY; THEOREM PROVING;

PUBLIC KEY CRYPTOGRAPHY;

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

References (22)

1. [BLS84] R. Book, T. Long, and A. Selman. Quantitative relativizations of complexity classes. SIAM Journal on Computing, 13(3):461-487, 1984.
2. [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.
3. [FGH+96] S. Fenner, F. Green, S. Homer, A. Selman, T. Thierauf, and H. Vollmer. Complements of multivalued functions. Chicago Journal of Theoretical Computer Science, Number 3, March 19, 1999.
4. [GG98] O. Goldreich and S. Goldwasser. The possibility of basing cryptography on the assumption that P ≠ NF. Available from http://theory.Ics.mit.edu/~tcryptol, 1998.
5. [GS88] J. Grollmann and A. Selman. Complexity measures for public-key cryptosystems. SIAM Journal on Computing, 17(2):309-335, 1988.
6. [GSSZ03] C. Glaßer, A. Selman, S. Sengupta, and L. Zhang. Disjoint NP-pairs. In Proceedings 18th Computational Complexity. IEEE Computer Society, pages 313-332, 2003.
7. SN(NP) distinguishes robust many-one and Turing completeness. Theory of Computing Systems, 31(3):307-325, 1998.
8. [HL94] S. Homer and L. Longpré. On reductions of NP sets to sparse sets. Journal of Computer and Systems Sciences, 48(2):324-336, 1994.
9. [HNOS96a] E. Hemaspaandra, A. Naik, M. Ogiwara, and A. Selman. P-selective sets and reducing search to decision vs. self-reducibility. Journal of Computer and System Sciences, 53:194-209, 1996. Special Issue of papers selected from the Eighth Annual IEEE Conference on Structure in Complexity Theory.
10. [HNOS96b] L. Hemaspaandra, A. Naik, M. Ogihara, and A. Selman. Computing solutions uniquely collapses the polynomial hierarchy. SIAM Journal on Computing, 25:697-708, 1996.
11. [KM00] J. Köbler and J. 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.
12. [KMT03] J. Köbler, J. Messner, and J. Torán. Optimal proof systems imply complete sets for promise classes. Information and Computation, 184:71-92, 2003.
13. [Kre88] M. W. Krentel. The complexity of optimization problems. Journal of Computer and System Sciences, 36:490-509, 1988.
14. [Lov79] L. Lovász. On the shannon capacity of graphs. IEEE Transactions on Information Theory, 25:1-7, 1979.
15. [OW91] M. Ogiwara and O. Watanabe. On polynomial-time bounded truth-table reducibility of NP sets to sparse sets. SIAM Journal of Computing, 20(3):471-483, 1991.
16. [PS01] A. Pavan and A. Selman. Separation of NP-completeness notions. In Proceedings 16th IEEE Conference on Computational Complexity. IEEE Computer Society, 2001.
17. [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.
18. [Raz94] A. Razborov. On provably disjoint NP-pairs. Technical Report TR94-006, Electronic Colloquium on Computational Complexity, 1994.
19. [Sad02] Z. Sadowski. On an optimal prepositional proof system and the structure of easy subsets of TAUT. Theoretical Computer Science, 288(1):181-193, 2002.
20. [Sel79] A. Selman. P-selective sets, tally languages, and the behavior of polynomial-time reducibilities on NP. Mathematical Systems Theory, 13:55-65, 1979.
21. [Sel82] A. Selman. Reductions on NP and p-selective sets. Theoretical Computer Science, 19:287-304, 1982.
22. [Sel94] A. Selman. A taxonomy on complexity classes of functions. Journal of Computer and System Sciences, 48:357-381, 1994.