Generalized Kolmogorov complexity and the structure of feasible computations
暂无分享,去创建一个
[1] Richard Edwin Stearns,et al. Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.
[2] Gregory J. Chaitin,et al. On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.
[3] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[4] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .
[5] Gregory J. Chaitin,et al. Information-Theoretic Limitations of Formal Systems , 1974, JACM.
[6] G. Chaitin. A Theory of Program Size Formally Identical to Information Theory , 1975, JACM.
[7] R. Solovay,et al. Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .
[8] John Gill,et al. Relativizations of the P =? NP Question , 1975, SIAM J. Comput..
[9] Juris Hartmanis,et al. On isomorphisms and density of NP and other complete sets , 1976, STOC '76.
[10] Alan J. Demers,et al. Some Comments on Functional Self-Reducibility and the NP Hierarchy , 1976 .
[11] Volker Strassen,et al. A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..
[12] Juris Hartmanis,et al. On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..
[13] 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).
[14] John Gill,et al. Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..
[15] Wolfgang J. Paul,et al. An Information-Theoretic Approach to Time Bounds for On-Line Computation , 1981, J. Comput. Syst. Sci..
[16] Stephen R. Mahaney. Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis , 1982, J. Comput. Syst. Sci..
[17] Juris Hartmanis. On Sparse Sets in NP - P , 1983, Inf. Process. Lett..
[18] Michael Sipser,et al. A complexity theoretic approach to randomness , 1983, STOC.
[19] Paul Young,et al. Some structural properties of polynomial reducibilities and sets in NP , 1983, STOC.
[20] Juris Hartmanis,et al. Computation Times of NP Sets of Different Densities , 1983, ICALP.
[21] Timothy J. Long,et al. Controlled relativizations of P and NP , 1983, Theoretical Computer Science.
[22] Wolfgang Maass,et al. Oracle-Dependent Properties of the Lattice of NP Sets , 1983, Theor. Comput. Sci..
[23] Neil Immerman,et al. Sparse sets in NP-P: Exptime versus nexptime , 1983, Inf. Control..