### Some connections between nonuniform and uniform complexity classes

暂无分享，去创建一个

[1] Albert R. Meyer,et al. The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[2] Nicholas Pippenger. On simultaneous resource bounds , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[3] Juris Hartmanis,et al. On isomorphisms and density of NP and other complete sets , 1976, STOC '76.

[4] Thomas J. Schaefer. On the Complexity of Some Two-Person Perfect-Information Games , 1978, J. Comput. Syst. Sci..

[5] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[6] Leonard M. Adleman,et al. Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[7] Claus-Peter Schnorr. Optimal Algorithms for Self-Reducible Problems , 1976, ICALP.

[8] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theoretical Computer Science.

[9] John E. Savage,et al. Computational Work and Time on Finite Machines , 1972, JACM.

[10] David A. Plaisted. New NP-hard and NP-complete polynomial and integer divisibility problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[11] Steven Fortune. A Note on Sparse Complete Sets , 1979, SIAM J. Comput..

[12] Leslie G. Valiant,et al. Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..

[13] Richard J. Lipton,et al. Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[14] Dexter Kozen. On parallelism in turing machines , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).