Geometric Sets of Low Information Content
暂无分享,去创建一个
[1] Osamu Watanabe,et al. On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets , 1991, SIAM J. Comput..
[2] Hans Heller,et al. On Relativized Exponential and Probabilistic Complexity Classes , 1986, Inf. Control..
[3] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[4] Ker-I Ko. On Self-Reducibility and Weak P-Selectivity , 1983, J. Comput. Syst. Sci..
[5] Vikraman Arvind,et al. On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets , 1992, FSTTCS.
[6] Stephen R. Mahaney. Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis , 1982, J. Comput. Syst. Sci..
[7] Mitsunori Ogihara. Polynomial-time membership comparable sets , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.
[8] David A. Plaisted. The Application of Multivariate Polynomials to Inference Rules and Partial Tests for Unsatisfiability , 1980, SIAM J. Comput..
[9] Richard J. Lipton,et al. Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.
[10] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1992, JACM.
[11] Mitsunori Ogihara,et al. On one query, self-reducible sets , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[12] Lane A. Hemaspaandra,et al. Reductions to Sets of Low Information Content , 1992, Complexity Theory: Current Research.
[13] Mitsunori Ogihara,et al. On Sparse Hard Sets for Counting Classes , 1993, Theor. Comput. Sci..
[14] Alexander Shen. IP = SPACE: simplified proof , 1992, JACM.
[15] R.E. Ladner,et al. A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..
[16] Uwe Schöning,et al. Complexity theory: current research , 1993 .
[17] U. Hertrampt. Relations among MOD-classes , 1990 .
[18] Frank Stephan,et al. Approximable Sets , 1995, Inf. Comput..
[19] José L. Balcázar. Self-Reducibility , 1990, J. Comput. Syst. Sci..