Splittings, Robustness, and Structure of Complete Sets

SIAM Journal on Computing

Volumn 27, Issue 3, 1998, Pages 637-653

  Buhrman, Harry ^a   Hoene, Albrecht ^b   Torenvliet, Leen ^c  

^a CWI   (Netherlands)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^c UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Completeness; Complexity; Mitoticity; Reductions

Indexed keywords

EID: 0542399751     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795279724     Document Type: Article

References (26)

1. K. AMBOS-SPIES, On the structure of polynomial time degrees, in Proc. Symposium on Theorectical Aspects of Computer Science, Lecture Notes in Comput. Sci. 166, M. Fontet and K. Mehlhorn, eds., Springer-Verlag, Berlin, 1984, pp. 198-208.
2. J. BALCÁZAR, J. DIAZ, AND J. GABARRÓ, Structural Complexity I, Springer-Verlag, Berlin, 1988.
3. L. BERMAN, Polynomial Reducibilities and Complete Sets, Ph.D. thesis, Cornell University, Ithaca, NY, 1977.
4. S. BREIDBART, On splitting recursive sets, J. Comput. System Sci., 17 (1978), pp. 56-64.
5. H. BUHRMAN, Resource Bounded Reductions, Ph.D. thesis, University of Amsterdam, 1993.
6. H. BUHRMAN, L. FORTNOW, AND L. TORENVLIET, Using autoreducibility in separating complexity classes, in Proc. 36th Annual IEEE Symposium on Foundations of Computer Science, Milwaukee, WI, IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 520-527.
7. H. BUHRMAN, S. HOMER, AND L. TORENVLIET, On complete sets for nondeterministic classes, Math. Systems Theory, 24 (1991), pp. 179-200.
8. H. BUHRMAN, E. SPAAN, AND L. TORENVLIET, The relative power of logspace and polynomial time reductions, Comput. Complexity, 3 (1993), pp. 231-244.
9. H. BUHRMAN AND L. TORENVLIET, On the structure of complete sets, in Proc. 9th Annual IEEE Conference on Structure in Complexity Theory, Amsterdam, Holland, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 118-133.
10. H. BUHRMAN, L. TORENVLIET, AND P. V. EMDE BOAS, Twenty questions to a p-selector, Inform. Process. Lett., 48 (1993), pp. 201-204.
11. H. BUHRMAN, AND L. TORENVLIET, P-selective self-reducible sets: A new characterization of P, J. Comput. System Sci., 53 (1996), pp. 210-217.
12. K. GANESAN AND S. HOMER, Complete problems and strong polynomial reducibilities, SIAM J. Comput., 21 (1992), pp. 733-742.
13. C. JOCKUSCH, Semirecursive sets and positive reducibility, Trans. Amer. Math. Soc., 131 (1968), pp. 420-436.
14. J. KELLY, General Topology, D. van Nostrand Company Inc., New York, 1955.
15. R. LADNER, Mitotic recursively enumerable sets, J. Symbolic Logic, 38 (1973), pp. 199-211.
16. R. LADNER, On the structure of polynomial time reducibility, J. Assoc. Comput. Mach., 22 (1975), pp. 155-171.
17. R. LADNER, N. LYNCH, AND A. SELMAN, A comparison of polynomial time reducibilities, Theoret. Comput. Sci., 1 (1975), pp. 103-123.
18. J. Myhill, Creative sets, Zeit. Math. Log. Grund. Math., l (1955), pp. 97-108.
19. J. OWINGS, Splitting a context-sensitive sci, J. Comput. System Sci., 10 (1975), pp. 83-87.
20. G. SACKS, On degrees less than 0′, Ann. of Math., 2 (1963), pp. 211-231.
21. U. SCHÖNING, Complete sets and closeness to complexity classes, Math. Systems Theory, 19 (1986), pp. 29-41.
22. A. SELMAN, P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP, Math. Systems Theory, 13 (1979), pp. 55-65.
23. S. TANG, B. FU, AND T. LIU, Exponential time and subexponential time sets, Theoret. Comput. Sci., 115 (1993), pp. 371-381.
24. S. TODA, On polynomial-time truth-table reducibilities of intractable sets to P-selective sets, Math. Systems Theory, 24 (1991), pp. 69-82.
25. O. WATANABE, A comparison of polynomial time completeness notions, Theoret. Comput. Sci., 54 (1987), pp. 249-265.
26. C. WILSON, Relativized circuit complexity, J. Comput. System Sci., 31 (1985), pp. 169-181.