New Collapse Consequences of NP Having Small Circuits

SIAM Journal on Computing

Volumn 28, Issue 1, 1998, Pages 311-324

  Köbler, Johannes ^a   Watanabe, Osamu ^b  

^a UNIVERSITY OF ULM   (Germany)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Advice classes; Lowness; Polynomial size circuits; Randomized computation

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; RANDOM PROCESSES;

POLYNOMIAL-SIZE CIRCUITS;

CIRCUIT THEORY;

EID: 0040061529     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795296206     Document Type: Article

References (41)

1. M. ABADI, J. FEIGENBAUM, AND J. KILIAN, On hiding information from an oracle, J. Comput. System Sci., 39 (1989), pp. 21-30.
2. D. ANGLUIN, Queries and concept learning, Mach. Learning, 2 (1988), pp. 319-342.
3. L. BABAI AND L. FORTNOW, Arithmetization: A new method in structural complexity, Comput. Complexity, 1 (1991), pp. 41-66.
4. L. BASAI, L. FORTNOW, AND C. LUND, Non-deterministic exponential time has two-prover interactive protocols, Comput. Complexity, 1 (1991), pp. 1-40.
5. L. BABAI AND S. MORAN, Arthur-merlin games: A randomized proof system and a hierarchy of complexity classes, J. Comput. System Sci., 36 (1988), pp. 254-276.
6. J. BALCÁZAR, Self-reducibility, J. Comput. System Sci., 41 (1990), pp. 367-388.
7. 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.
8. J. BALCÁZAR, R. BOOK, AND U. SCHÖNING, Sparse sets, lowness and highness, SIAM J. Comput., 23 (1986), pp. 679-688.
9. J. BALCÁZAR, J. DÍAZ, AND J. GABARRÓ, Structural Complexity I, 2nd ed., Springer-Verlag, Berlin, New York, 1995.
10. D. BOVET AND P. CRESCENZI, Introduction to the Theory of Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1994.
11. N. BSHOUTY, R. CLEVE, R. GAVALDÀ, S. KANNAN, AND C. TAMON, Oracles and queries that are sufficient for exact learning, J. Comput. System Sci., 52 (1996), pp. 421-433.
12. H. BUHRMAN, Personal communication. 1994.
13. J. L. CARTER AND M. N. WEGMAN, Universal classes of hash functions, J. Comput. Systemv Sci., 18 (1979), pp. 143-154.
14. R. GAVALDÀ, Bounding the complexity of advice functions, J. Comput. System Sci., 50 (1995), pp. 468-475.
15. J. GILL, Computational complexity of probabilistic complexity classes, SIAM J. Comput., 6 (1977), pp. 675-695.
16. J. HARTMANIS AND Y. YESHA, Computation times of NP sets of different densities, Theoret. Comput. Sci., 34 (1984), pp. 17-32.
17. H. HELLER, On relativized exponential and probabilistic complexity classes, Inform. and Control, 71 (1986), pp. 231-243.
18. L. A. HEMACHANDRA, M. OGIWARA, AND O. WATANABE, How hard are sparse sets?, in Proceedings of the 7th Structure in Complexity Theory Conference, IEEE Computer Society Press, Piscataway, NJ, 1992, pp. 222-238.
19. M. JERRUM, L. VALIANT, AND V. VAZIRANI, Random generation of combinatorial structures from a uniform distribution, Theoret. Comput. Sci., 43 (1986), pp. 169-188.
20. J. KÄMPER, Non-uniform proof systems: A new framework to describe non-uniform and probabilistic complexity classes, Theoret. Comput. Sci., 85 (1991), pp. 305-331.
21. R. KANNAN, Circuit-size lower bounds and non-reducibility to sparse sets, Inform. and Control, 55 (1982), pp. 40-56.
22. R. M. KARP AND R. J. LIPTON, Some connections between nonuniform and uniform complexity classes, in Proceedings of the 12th ACM Symposium on Theory of Computing, ACM Press, New York, 1980, pp. 302-309.
23. K. Ko, On self-reducibility and weak p-selectivity, J. Comput. System Sci., 26 (1983), pp. 209-221.
24. J. KÖBLER, Locating P/poly optimally in the extended low hierarchy, Theoret. Comput. Sci., 134 (1994), pp. 263-285.
25. J. KÖBLER, U. SCHÖNING, AND J. TORÁN, The Graph Isomorphism Problem: Its Structural Complexity, Birkháuser, Boston, 1993.
26. T. LONG, Strong nondeterministic polynomial-time reducibilities, Theoret. Comput. Sci., 21 (1982), pp. 1-25.
27. A. LOZANO AND J. TORÁN, Self-reducible sets of small density, Math. Systems Theory, 24 (1991), pp. 83-100.
28. C. LUND, L. FORTNOW, H. KARLOFF, AND N. NISAN, Algebraic methods for interactive proof systems, J. Assoc. Comput. Mach., 39 (1992), pp. 859-868.
29. M. OGIWARA AND A. LOZANO, On sparse hard sets for counting classes, Theoret. Comput. Sci., 112 (1993), pp. 255-275.
30. 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.
31. C. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
32. N. PIPPENGER, On simultaneous resource bounds, in Proceedings of the 20th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Piscataway, NJ. 1979, pp. 307-311.
33. U. SCHÖNING, Complexity and Structure, Lecture Notes in Computer Science 211, Springer-Verlag, New York, 1986.
34. M. SIPSER, A complexity theoretic approach to randoraness, in Proceedings of the 15th ACM Symposium on Theory of Computing, ACM Press, New York, 1983, pp. 330-335.
35. J. TARUI, Probabilistic polynomials, ACP functions, and the polynomial time hierarchy, Theoret. Comput. Sci., 113 (1993), pp. 167-183.
36. T. THIERAUF, Personal communication, 1994.
37. S. TODA AND M. OGIWARA, Counting classes are at least as hard as the polynomial-time hierarchy, SIAM J. Comput., 21 (1992), pp. 316-328.
38. J. TORÁN, Complexity classes defined by counting quantifiers, J. Assoc. Comput. Mach., 38 (1991), pp. 753-774.
39. C. WILSON, Relativized circuit complexity, J. Comput. System Sci., 31 (1985), pp. 169-181.
40. C. YAP, Some consequences of non-uniform conditions on uniform classes, Theoret. Comput. Sci., 26 (1983), pp. 287-300.
41. S. ZACHOS, Robustness of probabilistic computational complexity classes under definitional perturbations, Inform. and Control, 54 (1982), pp. 143-154.