Properties of NP-complete sets

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 19, Issue , 2004, Pages 184-197

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

^a UNIVERSITY OF WÜRZBURG   (Germany)

^b Iowa State University   (United States)

^c State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY CLASSES; PERMUTATIONS; PSEUDORANDOM GENERATORS; QUASIPOLYNOMIALS;

COMPUTATIONAL COMPLEXITY; INFORMATION ANALYSIS; MATHEMATICAL OPERATORS; POLYNOMIALS; THEOREM PROVING;

SET THEORY;

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

References (38)

1. [Agr02] M. Agrawal. Pseodo-random generators and structure of complete degrees. In Proceedings of the 17th IEEE Conference on Computational Complexity, pages 139-147. IEEE Computer Society, 2002.
2. [BBFG91] R. Beigel, M. Bellare, J. Feigenbaum, and S. Goldwasser. Languages that are easier than their proofs. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pages 19-28. IEEE Computer Society Press, 1991.
3. [Ber76] L. Berman. On the structure of complete sets: Almost everywhere complexity and infinitely often speedup. Proceedings of the 17th Annual Symposium on Foundations of Computer Science, pages 76-80. IEEE Computer Society Press, 1976.
4. [BGS75] T. Baker, J. Gill, and R. Solovay. Relativizations of the P=NP problem. SIAM Journal on Computing, 4:431-442, 1975.
5. [BH77] L. Berman and J. Hartmanis. On isomorphism and density of NP and other complete sets. SIAM Journal on Computing, 6:305-322, 1977.
6. [BH92] H. Buhrman and S. Homer. Snperpolynomial circuits, almost sparse oracles, and the exponential hierarchy. In Foundations of Software Technology and Theoretical Computer Science, 12th Conference, New Delhi, India, December 18-20,1992, Proceedings, volume 652 of Lecture Notes in Computer Science, pages 116-127. Springer-Verlag, 1992.
7. [BHT98] H. Buhrman, A. Hoene, and L. Torenvliet. Splittings, robustness, and structure of complete sets. SIAM Journal on Computing, 27(3):637-653, 1998.
8. [BM84] M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudorandom bits. SIAM Journal on Computing, 13(2):850-864, 1984.
9. [CR79] S. Cook and R. Reckhow. The relative efficiency of propositional proof systems. Journal of Symbolic Logic, 44:36-50, 1979.
10. [FFNR96] S. Fenner, L. Fortnow, A. Naik, and J. Rogers. On inverting onto functions. In Proceedings of the 11th Conference on Computational Complexity, pages 213-223. IEEE Computer Society Press, 1996.
11. [FPS01] L. Fortnow, A. Pavan, and A. Selman. Distributionally hard languages. Theory of Computing Systems, 34:245-261, 2001.
12. [Fu93] B. Fu. On lower bounds of the closeness between complexity classes. Mathematical Systems Theory, 26(2):187-202, 1993.
13. [GL89] O. Goldreich and L. Levin. A hardcore predicate for all one-way functions. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 25-32, 1989.
14. [Gol01] O. Goldreich. Foundations of Cryptography-Volume 1 Cambridge University Press, New York, 2001.
15. [GS88] J. Grollmann and A. Selman. Complexity measures for public-key cryptosystems. SIAM Journal on Computing, 17(2):309-335, 1988.
16. [GSS04] C. Glaßer, A. Selman, and S. Sengupta. Reductions between disjoint NP-pairs. In Proceedings of the 19th IEEE Conference on Computational Complexity, 2004. These Proceedings.
17. [GSSZ03] C. Glaßer, A. Selman, S. Sengupta, and L. Zhang. Disjoint NP-pairs. In Proceedings of the 18th IEEE Conference on Computational Complexity. IEEE Computer Society, 2003.
18. [HL94] S. Homer and L. Longpré. On reductions of NP sets to sparse sets. Journal of Computer and System Sciences, 48(2):324-336, 1994.
19. [HNOS96] 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.
20. [HKW97] L. Hemaspaandra, J. Rothe, and G. Wechsung. Easy sets and hard certificate schemes. Acta Informatica, 34:859-879, 97.
21. [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.
22. [HW94] S. Homer and J. Wang. Immunity of complete problems. Information and Computation, 110(1): 119-129, 1994.
23. [Ko82] Ker-I Ko. Some observations on probabilistic algorithms and NP-hard problems. Information Processing Letters, 14:39-43, 1982.
24. [Mah82] S. Mahaney. Sparse complete sets for NP: Solution of a conjecture of Herman and Hartmanis. Journal of Computer and System Sciences, 25(2):130-143, 1982.
25. [MY85] S. Mahaney and P. Young. Reductions among polynomial isomorphism types. Theoretical Computer Science, 39:207-224, 1985.
26. [NW94] N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
27. [Ogi91] M. Ogiwara. On P-closeness of polynomial-time hard sets, manuscript, 1991.
28. [OW91] M. Ogiwara and O. Watanabe. On polynomial-time bounded truth-table reducibility of NP sets to sparse sets. SIAM Journal on Computing, 20(3):471-483, 1991.
29. [PS01] A. Pavan and A. Selman. Separation of NP-completeness notions. In Proceedings of the 16th IEEE Conference on Computational Complexity. IEEE Computer Society, 2001.
30. [Raz94] A. Razborov. On provably disjoint NP-pairs. Technical Report TR94-006, Electronic Colloquium on Computational Complexity, 1994.
31. [Sch86] U. Schöning. Complete sets and closeness to complexity classes. Mathematical Systems Theory, 19:24-41, 1986.
32. [Se179] A. Selman. P-selective sets, tally languages, and the behavior of polynomial-time reducibilities on NP. Mathematical Systems Theory, 13:55-65, 1979.
33. [Se188] A. Selman. Natural self-reducible sets. SIAM Journal on Computing, 17(5):989-996, 1988.
34. [Sho76] J. R Shoenfield. Degrees of classes of RE sets. Journal of Symbolic Logic, 41(3):695-696, 1976.
35. [TFL93] S. Tang, B. Fu, and T. Liu. Exponential-time and subexponential-time sets. Theoretical Computer Science, 115(2):371-381, 1993.
36. [Tod91] S. Toda. On polynomial-time truth-table reducibilities of intractable sets to P-selective sets. Mathematical Systems Theory, 24:69-82, 1991.
37. [Yao82] A. C. C. Yao. Theory and applications of trapdoor functions. In Proceedings of the Annual Symposium on Foundations of Computer Science, pages 80-91. IEEE Computer Society Press, 1982.
38. [Yes83] Y. Yesha. On certain polynomial-time truth-table reducibilities of complete sets to sparse sets. SIAM Journal on Computing, 12(3):411-425, 1983.