Separating NE from Some Nonuniform Nondeterministic Complexity Classes
暂无分享,去创建一个
[1] Sarah Mocas,et al. Separating Classes in the Exponential-Time Hierarchy From Classes in PH , 1996, Theor. Comput. Sci..
[2] Bin Fu. On lower bounds of the closeness between complexity classes , 2005, Mathematical systems theory.
[3] Lane A. Hemaspaandra,et al. The Complexity Theory Companion , 2002, Texts in Theoretical Computer Science An EATCS Series.
[4] Hans-Jörg Burtschick,et al. On sets turing reducible to p-selective sets , 2007, Theory of Computing Systems.
[5] Stephen A. Cook,et al. A hierarchy for nondeterministic time complexity , 1972, J. Comput. Syst. Sci..
[6] Stephen R. Mahaney. Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[7] Mitsunori Ogihara,et al. On the Reducibility of Sets Inside NP to Sets with Low Information Content , 2004 .
[8] Steven Homer,et al. Complete Problems and Strong Polynomial Reducibilities , 1992, SIAM J. Comput..
[9] Lane A. Hemaspaandra,et al. Theory of Semi-Feasible Algorithms , 2002, Monographs in Theoretical Computer Science An EATCS Series.
[10] Jin-Yi Cai,et al. Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis , 1999, J. Comput. Syst. Sci..
[11] Harry Buhrman,et al. On the Cutting Edge of Relativization: The Resource Bounded Injury Method , 1994, ICALP.
[12] Yaacov Yesha,et al. On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets , 1983, SIAM J. Comput..
[13] Osamu Watanabe,et al. On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets , 1991, SIAM J. Comput..
[14] Richard J. Lipton,et al. Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.
[15] Alan L. Selman,et al. P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP , 1979, Mathematical systems theory.
[16] Juris Hartmanis,et al. On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..
[17] Bin Fu,et al. Some properties of exponential time complexity classes , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.
[18] Steven Homer,et al. Computability and Complexity Theory , 2001, Texts in Computer Science.