Completeness and Weak Completeness under Polynomial-Size Circuits

Information and Computation

Volumn 125, Issue 1, 1996, Pages 13-31

  Juedes, David W ^a   Lutz, Jack H ^b  

^a US Institute of Navigation   (United States)

^b Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041127568     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0017     Document Type: Article

References (59)

1. Ajtai, M., and Fagin, R. (1990), Reachability is harder for directed than for undirected graphs, J. Symbolic Logic 55, 113-150.
2. Allender, E., and Rubinstein, R. (1988), P-printable sets, SIAM J. Computing 17, 1193-1202.
3. Allender, E. W. (1989), Some consequences of the existence of pseudorandom generators, J. Comput. System Sci. 39, 101-124.
4. Allender, E. W., and Watanabe, O. (1990), Kolmogorov complexity and degrees of tally sets, Inform. and Comput. 86, 160-178.
5. Ambos-Spies, K., Neis, H.-C., and Terwijn, S. A. (1994), Genericity and measure for exponential time, Theoret. Comput. Sci., to appear; see also "Proceedings of the 19th Symposium on Mathematical Foundations of Computer Science," pp. 221-232, Springer-Verlag, Berlin/New York.
6. Ambos-Spies, K., Neis, H.-C., and Terwijn, S. A. (1994), Genericity and measure for exponential time, Theoret. Comput. Sci., to appear; see also "Proceedings of the 19th Symposium on Mathematical Foundations of Computer Science," pp. 221-232, Springer-Verlag, Berlin/New York.
7. Ambos-Spies, K., Terwijn, S. A., and Xizhong, Zheng (1994), Resource bounded randomness and weakly complete problems, Theoret. Comput. Sci., to appear; see also "Proceedings of the Fifth Annual International Symposium on Algorithms and Computation," pp. 369-377, Springer-Verlag, Berlin/New York.
8. Ambos-Spies, K., Terwijn, S. A., and Xizhong, Zheng (1994), Resource bounded randomness and weakly complete problems, Theoret. Comput. Sci., to appear; see also "Proceedings of the Fifth Annual International Symposium on Algorithms and Computation," pp. 369-377, Springer-Verlag, Berlin/New York.
9. Balcázar, J. L., and Book, R. V. (1986), Sets with small generalized Kolmogorov complexity, Acta Informat. 23, 679-688.
10. Balcázar, J. L., and Schöning, U. (1985), Bi-immune sets for complexity classes, Math. Systems Theory 18, 1-10.
11. Berman, L., and Hartmanis, J. (1977), On isomorphism and density of NP and other complete sets, SIAM J. Comput. 6, 305-322.
12. Billingsley, P. (1986), "Probability and Measure," 2nd ed., Wiley, New York.
13. Book, R., and Du, D.-Z. (1987), The existence and density of generalized complexity cores, J. Assoc. Comput. Mach. 34, 718-730.
14. Book, R., Du, D.-Z., and Russo, D. (1988), On polynomial and generalized complexity cores, "Proceedings of the Third Structure in Complexity Theory Conference," pp. 236-250, IEEE Comput. Soc. Press, Los Alamitos, CA.
15. Chaitin, G. J. (1966), On the length of programs for computing finite binary sequences, J. Assoc. Comput. Mach. 13, 547-569.
16. Cook, S. A. (1971), The complexity of theorem proving procedures, in "Proceedings of the Third ACM Symposium on the Theory of Computing," pp. 151-158, Assoc. Comput. Mach., New York.
17. Du, D.-Z. (1985), "Generalized Complexity Cores and Levelability of Intractable Sets," Ph.D. thesis, University of California, Santa Barbara.
18. Du, D.-Z., and Book, R. (1989), On inefficient special cases of NP-complete problems, Theoret. Comput. Sci. 63, 239-252.
19. Even, S., Selman, A., and Yacobi, Y. (1985), Hard core theorems for complexity classes, J. Assoc. Comput. Mach. 35, 205-217.
20. Fenner, S. A., Lutz, J. H., and Mayordomo, E. (1995), Weakly useful sequences, in "Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming," pp. 393-404, Springer-Verlag, Berlin/New York.
21. Halmos, P. R. (1950), "Measure Theory," Springer-Verlag, New York.
22. Hartmanis, J. (1983), Generalized Kolmogorov complexity and the structure of feasible computations, in "Proceedings of the 24th IEEE Symposium on the Foundations of Computer Science," pp. 439-445, IEEE, New York.
23. Hartmanis, J., and Yesha, Y. (1984), Computation times of NP sets of different densities, Theoret. Comput. Sci. 34, 17-32.
24. Huynh, D. T. (1986), Resource-bounded Kolmogorov complexity of hard languages, in "Structure in Complexity Theory," pp. 184-195, Springer-Verlag, Berlin.
25. Huynh, D. T. (1987), On solving hard problems by polynomial-size circuits, Inform. Process. Lett. 24, 171-176.
26. Juedes, D. W. (1994), "The Complexity and Distribution of Computationally Useful Problems," Ph.D. thesis, Iowa State University.
27. Juedes, D. W. Weakly complete problems are not rare, Comput. Complexity, to appear.
28. Juedes, D. W., and Lutz, J. H. (1995), The complexity and distribution of hard problems, SIAM J. Comput. 24, 279-295.
29. 2, Theoret. Comput. Sci. 143, 149-158.
30. Kannan, R. (1982), Circuit-size lower bounds and non-reducibility to sparse sets, Inform, and Control 55, 40-56.
31. Karp, R. M. (1972), Reducibility among combinatorial problems, in "Complexity of Computer Computations" (R. E. Miller and J. W. Thatcher, Eds.), pp. 85-104, Plenum, New York.
32. Ko, K. (1986), On the notion of infinite pseudorandom sequences, Theoret. Comput. Sci. 48, 9-33.
33. Kolmogorov, A. N. (1965), Three approaches to the quantitative definition of "information," Problems Inform. Transmission 1, 1-7.
34. Levin, L. A. (1973), Universal sequential search problems, Problems Inform. Transmission 9, 265-266.
35. Levin, L. A. (1984), Randomness conservation inequalities; Information and independence in mathematical theories, Inform. and Control 61, 15-37.
36. Lindner, W. (1993), "On the Polynomial Time Bounded Measure of One-Truth-Table Degrees and p-Selectivity," Diplomarbeit, Technische Universität Berlin.
37. Longpré, L. (1986), "Resource Bounded Kolmogorov Complexity, a Link Between Computational Complexity and Information Theory," Ph.D. thesis, Cornell University; Technical Report TR-86-776.
38. Lutz, J. H. (1990), Category and measure in complexity classes, SIAM J. Comput. 19, 1100-1131.
39. Lutz, J. H. (1991), An upward measure separation theorem, Theoret. Comput. Sci. 81, 127-135.
40. Lutz, J. H. (1992), Almost everywhere high nonuniform complexity, J. Comput. System Sci. 44, 220-258.
41. Lutz, J. H. (1995), Weakly hard problems, SIAM J. Comput. 24, 1170-1189.
42. Lutz, J. H., Resource-bounded measure, in preparation.
43. Lutz, J. H., and Mayordomo, E. (1994), Cook versus Karp-Levin: Separating completeness notions if NP is not small, Theoret. Comput. Sci., to appear; see also "Proceedings of the Eleventh Symposium on Theoretical Aspects of Computer Science," pp. 415-426, Springer- Verlag, Berlin/New York.
44. Lutz, J. H., and Mayordomo, E. (1994), Cook versus Karp-Levin: Separating completeness notions if NP is not small, Theoret. Comput. Sci., to appear; see also "Proceedings of the Eleventh Symposium on Theoretical Aspects of Computer Science," pp. 415-426, Springer-Verlag, Berlin/New York.
45. Lutz, J. H., and Mayordomo, E. (1994), Measure, stochasticity, and the density of hard languages, SIAM J. Comput. 23, 762-779.
46. Lynch, N. (1975), On reducibility to complex or sparse sets, J. Assoc. Comput. Mach. 22, 341-345.
47. Martin-Löf, P. (1971), Complexity oscillations in infinite binary sequences, Z. Wahrscheinlichkeitstheorie Verwandte Gebiete 19, 225-230.
48. Mayordomo, E. (1994), "Contributions to the Study of Resource-Bounded Measure," Ph.D. thesis, Universitat Politècnica de Catalunya.
49. Meyer, A. R. (1977), Reported in [9].
50. Orponen, P. (1986), A classification of complexity core lattices, Theoret. Comput. Sci. 70, 121-130.
51. Orponen, P., and Schöning, U. (1986), The density and complexity of polynomial cores for intractable sets, Inform. and Control 70, 54-68.
52. Pippenger, N. (1979), On simultaneous resource bounds, "Proceedings of the 20th IEEE Symposium on Foundations of Computer Science," pp. 307-311, IEEE, New York.
53. Razborov, A., and Rudich, S. (1994), Natural proofs, in "Proceedings of the 26th ACM Symposium on Theory of Computing," pp. 204-214, ACM Press, New York.
54. Regan, K. W., Sivakumar, D., and Cai, J. (1995), On resource-bounded measure and pseudorandom generators, "Proceedings of the 36th Symposium on the Foundations of Computer Science," pp. 26-35, IEEE, New York.
55. Russo, D. A., and Orponen, P. (1987), On P-subset structures, Math. Systems Theory 20, 129-136.
56. Sipser, M. (1983), A complexity-theoretic approach to randomness, in "Proceedings of the 15th ACM Symposium on Theory of Computing," pp. 330-335, Assoc. Comput. Mach., New York.
57. Skyum, S., and Valiant, L. G. (1985), A complexity theory based on boolean algebra, J. Assoc. Comput. Mach. 32, 484-502.
58. Solomonoff, R. J. (1964), A formal theory of inductive inference, Inform, and Control 7 (1964), 1-22, 224-254.
59. Ye, H. (1990), Complexity cores for P/poly, manuscript.