P-selective self-reducible sets: A new characterization of P

Journal of Computer and System Sciences

Volumn 53, Issue 2, 1996, Pages 210-217

  Buhrman, Harry ^a,b   Torenvliet, Leen ^b  

^a CWI   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; EQUIVALENCE CLASSES; MATHEMATICAL MODELS; POLYNOMIALS; THEOREM PROVING; TURING MACHINES;

AUTO REDUCIBILITY; P SELECTIVE SETS; SELF REDUCIBILITY; SELF REDUCIBLE SETS;

COMPUTATIONAL COMPLEXITY;

EID: 0030262606     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0062     Document Type: Article

References (32)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedi, Proof verification and hardness of approximation problems, in "Proceedings, 33rd IEEE Symposium Foundations of Computer Science, 1992."
2. K. Ambos-Spies, p-mitotic sets, in "Logic and Machines" (E. Borger, G. Hasenjäger, and D. Roding, Eds.), Lecture Notes in Computer Science, Vol. 177, pp. 1-23, Springer-Verlag, New York/Berlin, 1984.
3. R. Beigel, M. Bellare, J. Feigenbaum, and S. Goldwasser, Languages that are easier to verify than their proofs, in "Proceedings, 32nd IEEE Symposium on Foundations of Computer Science, 1991," pp. 19-28.
4. A. Borodin and A. Demers, "Some Comments on Functional Self-Reducibility and the NP Hierarchy," Technical Report TR76-284, Cornell University, Department of Computer Science, 1976.
5. J. Balcázar, J. Díaz, and J. Gabarró, "Structural Complexity I," Springer-Verlag, New York/Berlin, 1988.
6. R. Beigel and J. Feigenbaum, On being incoherent without being very hard, Comput. Complexity 2, No. 1 (1992), 1-17.
7. L. Babai, L. Fortnow, and C. Lund, Non-deterministic exponential time has two-prover interactive protocols, in "Proceedings, 31st IEEE Symposium Foundations of Computer Science, 1990," pp. 16-25.
8. R. Beigel, M. Kummer, and F. Stephan, Approximate sets, in "Proceedings, Structure in Complexity Theory 9th Annual Conference, Amsterdam, Holland, 1994," pp. 12-23, IEEE Comput. Soc., New York, 1994.
9. R. Book, Tally languages and complexity classes, Inform. and Control 26 (1974), 186-193.
10. H. Buhrman, L. Torenvliet, and P. Van Emde Boas, Twenty questions to a p-selector, Inform. Process. Lett. 48, No. 4 (1993), 201-204.
11. J. Edmonds, Paths, trees and flowers, Canad. J. Math. 17 (1965), 449-467.
12. J. Goldsmith, L. Hemachandra, D. Joseph, and P. Young, Near-testable sets, SIAM J. Comput. 20, No. 3, 506-523.
13. J. Goldsmith, D. Joseph, and P. Young, Using self-reducibilities to characterize polynomial time, Inform. and Comput. 104, No. 2 (1993), 288-308.
14. L. A. Hemachandra, A. Hoene, M. Ogiwara, L. Selman, T. Thierauf, and J. Wang, Selectivity, manuscript, 1992.
15. J. Hartmanis, N. Immerman, and V. Sewelson, Sparse sets in NP-P: EXPTIME versus NEXPTIME, Inform. and Control 65, No. 2/3 (1985), 158-181.
16. N. Immermam, Languages that capture complexity classes, SIAM J. Comput. 16 (1984), 760-778.
17. N. Immerman, Expressibility as a complexity measure: Results and directions, in "Proceedings, Structure in Complexity Theory 2nd Annual Conference, Ithaca, NY, 1987," pp. 194-202, IEEE Comput. Soc., New York, 1987.
18. C. G. Jockusch, Semirecursive sets and positive reducibility, Trans. Amer. Math. Soc. 131 (1968), 420-436.
19. K. Ko, On self-reducibility and weak P-selectivity, J. Comput. System Sci. 26 (1983), 209-211.
20. R. Ladner, Mitotic recursively enumerable sets, J. Symbolic Logic 38, No. 2 (1973), 199-211.
21. R. Ladner, N. Lynch, and A Selman, A comparison of polynomial time reducibilities, Theoret. Comput. Sci. 1 (1975), 103-123.
22. J. W. Moon, "Topics on Tournaments," Selected Topics in Mathematics, Holt, Rinehart, Winston, New York, 1968.
23. A. Meyer and M. Paterson, "With What Frequency are apparently Intractable Problems Difficult?" Technical Report MIT/LCS/TM-126, MIT, 1979.
24. A. V. Naik, Personal communication, E-mail, 1992.
25. A.V. Naik, M. Ogihara, and A. L. Selman, P-selective sets, and reducing search to decision vs self-reducibility, in "Proceedings, Structure in Complexity Theory 8th Annual Conference, San Diego, CA, 1993," pp. 52-64, IEEE Comput. Soc., New York, 1993.
26. N. Pippenger, On simultaneous resource bounds, in "Proceedings, 20th IEEE Symposium on Foundations of Computer Science, 1979," pp. 307-311.
27. A. Selman, P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP, Math. Systems Theory 13 (1979), 55-65.
28. A. Selman, Reductions on NP and P-selective sets, Theoret. Comput. Sci. 19 (1982), 287-304.
29. A. L. Selman, Promise problems complete for complexity classes, Inform. and Comput. 78, No. 2 (1988), 87-97.
30. A. L. Selman, Personal communication, E-mail, 1992.
31. A. Shamir, IP = PSPACE, in "Proceedings, 31st IEEE Symposium Foundations of Computer Science, 1990," pp. 11-15.
32. S. Toda, On polynomial-time truth-table reducibility of intractable sets to P-selective sets, Math. Systems Theory 24 (1991), 69-82.