Unambiguous computation: Boolean hierarchies and sparse turing-complete sets

SIAM Journal on Computing

Volumn 26, Issue 3, 1997, Pages 634-653

  Hemaspaandra, Lane A ^a   Rothe, Jörg ^b  

^a University of Rochester   (United States)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Boolean hierarchy; Sparse Turing complete sets; Unambiguous computation

Indexed keywords

EID: 0013262329     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794261970     Document Type: Article

References (64)

1. J. BALCÁZAR, R. BOOK, AND U. SCHÖNING, The polynomial-time hierarchy and sparse oracles, J. Assoc. Comput. Mach., 33 (1986), pp. 603-617.
2. R. BEIGEL, On the relativized power of additional accepting paths, in Proc. 4th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 216-224.
3. R. BEIGEL, R. CHANG, AND M. OGIWARA, A relationship between difference hierarchies and relativized polynomial hierarchies, Math. Systems Theory, 26 (1993), pp. 293-310.
4. R. BEIGEL AND J. GOLDSMITH, Downward separation fails catastrophically for limited nondeterminism classes, in Proc. 9th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 134-138.
5. A. BERTONI, D. BRUSCHI, D. JOSEPH, M. SITHARAM, AND P. YOUNG, Generalized Boolean hierarchies and Boolean hierarchies over RP, in Proc. 7th Conference on Fundamentals of Computation Theory, Lecture Notes in Comput. Sci. 380, Springer-Verlag, Berlin, 1989, pp. 35-46.
6. A. BLASS AND Y. GUREVICH, On the unique satisfiability problem, Inform, and Control, 55 (1982), pp. 80-88.
7. D. BRUSCHI, D. JOSEPH, AND P. YOUNG, Strong separations for the Boolean hierarchy over RP, Internat. J. Found. Comput. Sci., 1 (1990), pp. 201-218.
8. J. CAI, Probability one separation of the Boolean hierarchy, in Proc. 4th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 247, Springer-Verlag, Berlin, 1987, pp. 148-158.
9. J. CAI, T. GUNDERMANN, J. HARTMANIS, L. HEMACHANDRA, V. SEWELSON, K. WAGNER, AND G. WECHSUNG, The Boolean hierarchy I: Structural properties, SIAM J. Comput., 17 (1988), pp. 1232-1252.
10. J. CAI, T. GUNDERMANN, J. HARTMANIS, L. HEMACHANDRA, V. SEWELSON, K. WAGNER, AND G. WECHSUNG, The Boolean hierarchy II: Applications, SIAM J. Comput., 18 (1989), pp. 95-111.
11. J. CAI AND L. HEMACHANDRA, The Boolean hierarchy: Hardware over NP, Technical Report 85-724, Department of Computer Science, Cornell University, Ithaca, NY, 1985.
12. J. CAI, L. HEMACHANDRA, AND J. VYSKOČ, Promises and fault-tolerant database access, in Complexity Theory, K. Ambos-Spies, S. Homer, and U. Scheming, eds., Cambridge University Press, Cambridge, UK, 1993, pp. 101-146.
13. P-complete, SIAM J. Comput., 16 (1987), pp. 259-277.
14. R. CHANG, On the structure of NP computations under Boolean operators, Ph.D. thesis, Cornell University, Ithaca, NY, 1991.
15. R. CHANG AND J. KADIN, On computing Boolean connectives of characteristic functions, Technical Report TR 90-1118, Department of Computer Science, Cornell University, Ithaca, NY, 1990.
16. R. CHANG AND J. KADIN, The Boolean hierarchy and the polynomial hierarchy: A closer connection, SIAM J. Comput., 25 (1996), pp. 340-354.
17. S. COOK, The complexity of theorem-proving procedures, in Proc. 3rd ACM Symposium on Theory of Computing, ACM, New York, 1971, pp. 151-158.
18. K. CRONAUER, A criterion to separate complexity classes by oracles, Technical Report 76, Institut für Informatik, Universität Würzburg, Würzburg, Germany, 1994.
19. J. GROLLMANN AND A. SELMAN, Complexity measures for public-key cryptosystems, SIAM J. Comput., 17 (1988), pp. 309-335.
20. T. GUNDERMANN, N. NASSER, AND G. WECHSUNG, A survey on counting classes, in Proc. 5th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 140-153.
21. T. GUNDERMANN AND G. WECHSUNG, Counting classes with finite acceptance types, Comput. Artificial Intelligence, 6 (1987), pp. 395-409.
22. J. HARTMANIS AND L. HEMACHANDRA, Complexity classes without machines: On complete languages for UP, Theoret. Comput. Sci., 58 (1988), pp. 129-142.
23. J. HARTMANIS AND L. HEMACHANDRA, Robust machines accept easy sets, Theoret. Comput. Sci., 74 (1990), pp. 217-226.
24. J. HARTMANIS, N. IMMERMAN, AND V. SEWELSON, Sparse sets in NP-P: EXPTIME versus NEXPTIME, Inform. and Control, 65 (1985), pp. 159-181.
25. J. HARTMANIS AND R. STEARNS, On the computational complexity of algorithms, Trans. Amer. Math. Soc., 117 (1965), pp. 285-306.
26. F. HAUSDORFF, Grundzüge der Mengenlehre, Walter De Gruyten & Co., Berlin, Leipzig, 1927.
27. L. HEMACHANDRA, Counting in Structural Complexity Theory, Ph.D. thesis, Technical Report TR87-840, Department of Computer Science, Cornell University, Ithaca, NY, 1987.
28. L. HEMACHANDRA, M. OGIWARA, AND O. WATANABE, How hard are sparse sets?, in Proc. 7th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 222-238.
29. L. HEMACHANDRA AND R. RUBINSTEIN, Separating complexity classes with tally oracles, Theoret. Comput. Sci., 92 (1992), pp. 309-318.
30. E. HEMASPAANDRA AND L. HEMASPAANDRA, Quasi-injective reductions, Theoret. Comput. Sci., 123 (1994), pp. 407-413.
31. L. HEMASPAANDRA, S. JAIN, AND N. VERESHCHAGIN, Banishing robust Turing completeness, Internat. J. Found. Comput. Sci., 4 (1993), pp. 245-265.
32. L. HEMASPAANDRA AND S. JHA, Defying upward and downward separation, Inform, and Computation, 121 (1995), pp. 1-13.
33. L. HEMASPAANDRA AND M. ZIMAND, Strong self-reducibility precludes strong immunity, Math. Systems Theory, 29 (1996), pp. 535-548.
34. J. HOPCROFT, Recent directions in algorithmic research, in Proc. 5th GI Conference on Theoretical Computer Science, Lecture Notes in Comput. Sci. 104, Springer-Verlag, Berlin, 1981, pp. 123-134.
35. J. HOPCROFT AND J. ULLMAN, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
36. R. IMPAGLIAZZO AND G. TARDOS, Decision versus search problems in super-polynomial time, in Proc. 30th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 222-227.
37. J. KADIN, The polynomial time hierarchy collapses if the Boolean hierarchy collapses, SIAM J. Comput., 17 (1988), pp. 1263-1282; erratum, SIAM J. Comput., 20 (1991), p. 404.
38. NP[log n] and sparse Turing-complete sets for NP, J. Comput. System Sci., 39 (1989), pp. 282-298.
39. R. KARP AND R. LIPTON, Some connections between nonuniform and uniform complexity classes, in Proc. 12th ACM Symposium on Theory of Computing, ACM, New York, 1980, pp. 302-309; an extended version has also appeared as Turing machines that take advice, Enseign. Math. (2), 28 (1982), pp. 191-209.
40. R. KARP AND R. LIPTON, Some connections between nonuniform and uniform complexity classes, in Proc. 12th ACM Symposium on Theory of Computing, ACM, New York, 1980, pp. 302-309; an extended version has also appeared as Turing machines that take advice, Enseign. Math. (2), 28 (1982), pp. 191-209.
41. K. KO AND U. SCHÖNING, On circuit-size complexity and the low hierarchy in NP, SIAM J. Comput., 14 (1985), pp. 41-51.
42. J. KÖBLER, U. SCHÖNING, AND K. WAGNER, The difference and truth-table hierarchies for NP, RAIRO Inform. Théor. Appl., 21 (1987), pp. 419-435.
43. J. KÖBLER AND O. WATANABE, New collapse consequences of NP having small circuits, in Proc. 22nd International Colloquium on Automata, Languages, and Programming, Lecture Notes in Comput. Sci. 944, Springer-Verlag, Berlin, 1995, pp. 196-207.
44. K.-J. LANGE AND P. ROSSMANITH, Unambiguous polynomial hierarchies and exponential size, in Proc. 9th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 106-115.
45. L. LEVIN, Universal sorting problems, Problems Inform. Transmission, 9 (1973), pp. 265-266.
46. T. LONG AND A. SELMAN, Relativizing complexity classes with sparse oracles, J. Assoc. Comput. Mach., 33 (1986), pp. 618-627.
47. A. MEYER AND M. PATERSON, With what frequency are apparently intractable problems difficult?, Technical Report MIT/LCS/TM-126, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1979.
48. A. MEYER AND L. STOCKMEYER, The equivalence problem for regular expressions with squaring requires exponential space, in Proc. 13th IEEE Symposium on Switching and Automata Theory, IEEE Computer Society Press, Los Alamitos, CA, 1972, pp. 125-129.
49. R. NIEDERMEIER AND P. ROSSMANITH, Extended locally definable acceptance types, in Proc. 10th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 665, Springer-Verlag, Berlin, 1993, pp. 473-483.
50. M. OGIWARA AND O. WATANABE, On polynomial-time bounded truth-table reducibility of NP sets to sparse sets, SIAM J. Comput., 20 (1991), pp. 471-483.
51. C. PAPADIMITRIOU AND M. YANNAKAKIS, The complexity of facets (and some facets of complexity), J. Comput. System Sci., 28 (1984), pp. 244-259.
52. R. RAO, J. ROTHE, AND O. WATANABE, Upward separation for FewP and related classes, Inform. Process. Lett., 52 (1994), pp. 175-180.
53. K. REGAN, Provable complexity properties and constructive reasoning, manuscript, 1989.
54. U. SCHÖNING, A low and a high hierarchy within NP, J. Comput. System Sci., 27 (1983), pp. 14-28.
55. U. SCHÖNING, Complexity and Structure, Lecture Notes in Comput. Sci. 211, Springer-Verlag, 1986.
56. L. SELMAN, Natural self-reducible sets, SIAM J. Comput., 17 (1988), pp. 989-996.
57. M. SHEU AND T. LONG, UP and the low and high hierarchies: A relativized separation, Math. Systems Theory, 29 (1996), pp. 423-450.
58. L. STOCKMEYER, The polynomial-time hierarchy, Theoret. Comput. Sci., 3 (1977), pp. 1-22.
59. S. TODA, On polynomial-time truth-table reducibilities of intractable sets to P-selective sets, Math. Systems Theory, 24 (1991), pp. 69-82.
60. L. VALIANT, The relative complexity of checking and evaluating, Inform. Process. Lett., 5 (1976), pp. 20-23.
61. O. WATANABE, On hardness of one-way functions, Inform. Process. Lett., 27 (1988), pp. 151-157.
62. P. YOUNG, How reductions to sparse sets collapse the polynomial-time hierarchy: A primer, SIGACT News, 1992, #3, pp. 107-117 (part I), #4, pp. 83-94 (part II), and #4, p. 94 (corrigendum to part I).
63. P. YOUNG, How reductions to sparse sets collapse the polynomial-time hierarchy: A primer, SIGACT News, 1992, #3, pp. 107-117 (part I), #4, pp. 83-94 (part II), and #4, p. 94 (corrigendum to part I).
64. P. YOUNG, How reductions to sparse sets collapse the polynomial-time hierarchy: A primer, SIGACT News, 1992, #3, pp. 107-117 (part I), #4, pp. 83-94 (part II), and #4, p. 94 (corrigendum to part I).