Computation Times of NP Sets of Different Densities
暂无分享,去创建一个
[1] Stephen R. Mahaney. Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis , 1982, J. Comput. Syst. Sci..
[2] Richard J. Lipton,et al. Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.
[3] Piotr Berman. Relationship Between Density and Deterministic Complexity of NP-Complete Languages , 1978, ICALP.
[4] Juris Hartmanis. On Sparse Sets in NP - P , 1983, Inf. Process. Lett..
[5] Leonard M. Adleman,et al. Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[6] Ronald V. Book,et al. Tally Languages and Complexity Classes , 1974, Inf. Control..
[7] Ronald V. Book,et al. Relativizing time and space , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[8] Juris Hartmanis,et al. On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..
[9] John Gill,et al. Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..
[10] John Gill,et al. Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..