Richard M. Karp
ABSTRACT
It is well known that every set in P has small circuits [13]. Adleman [1] has recently proved the stronger result that every set accepted in polynomial time by a randomized Turing machine has small circuits. Both these results are typical of the known relationships between uniform and nonuniform complexity bounds. They obtain a nonuniform upper bound as a consequence of a uniform upper bound.
The central theme here is an attempt to explore the converse direction. That is, we wish to understand when nonuniform upper bounds can be used to obtain uniform upper bounds.
In this section we will define our basic notion of nonuniform complexity. Then we will show how to relate it to more common notions.
- 1.L. Adleman, “Two Theorems on Random Polynomial Time,” Proc. 19th IEEE Symp. on Foundations of Computer Science, pp. 75–83 (1978).Google Scholar
- 2.R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovasz C. Rackoff, “Random Walks, Universal Sequences, and the Complexity of Maze Problems,” Proc. 20th IEEE Symp. on Foundations of Computer Science, (1979).Google Scholar
- 3.A.K. Chandra and L.J. Stockmeyer, “Alternation,” Proc. 17th IEEE Symp. on Foundations of Computer Science, (1976).Google Scholar
- 4.S.A. Cook, “The Complexity of Theorem-Proving Procedures,” Proc. 3rd ACM Symp. on Theory of Computing, pp. 151–158 (1971). Google ScholarDigital Library
- 5.S. Fortune, “A Note on Sparse Complete Sets,” SIAM J. Computing 8, pp. 431–433 (1979).Google ScholarDigital Library
- 6.J. Hartmanis and L. Berman, “On Isomorphisms and Density of NP and Other Complete Sets,” Proc. 8th ACM Symp. on Theory of Computing, pp, 30–40 (1976). Google ScholarDigital Library
- 7.R.M. Karp, “Reducibility Among Combinatorial Problems,” in Complexity of Computer Computations (R.E. Miller and J.W. Thatcher, eds.), Plenum, New York (1972).Google Scholar
- 8.D. Kozen, “On Parallelism in Turing Machines,” Proc. IEEE Symp. Foundations of Computer Science, (1976).Google Scholar
- 9.A.R. Meyer and M.S. Paterson, “With What Frequency are Apparently Intractable Problems Difficult”, M.I.T. Tech. Report, Feb. 1979.Google Scholar
- 10.A.R. Meyer and L.J. Stockmeyer, “The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space,” Proc. 13th IEEE Symp. on Switching and Automata Theory, pp. }25;}29 (1972).Google Scholar
- 11.N. Pippenger, “On Simultaneous Resource Bounds,” Proc. 20th IEEE Symp. on Foundations of Computer Science, (}979) Google Scholar
- 12.D.A. Plaisted, “New NP-hard and NP-complete Polynomial and Integer Divisibility Problems,” Proc. 18th IEEE Symp. FOCS, pp. 241–253 (1977).Google Scholar
- 13.S.E. Savage, “Computational Work and Time on Finite Machines,” JACM 19, (4), pp. 660–674 (1972). Google Scholar
- 14.T.S. Schaefer, “On the Complexity of Some Two-Person Perfect-Information Games,” JCSS 16, pp. }85–225 (1978).Google Scholar
- 15.C.P. Schnorr, “Optimal Algorithms for Self-Reducible Problems, 3rd Int. Coll. on Automata, Lang. and Programming, Edinburgh (1976).Google Scholar
- 16.L.J. Stockmeyer, “The Polynomial-Time Heirarchy”, Theoretical Computer Science 3, p. 1–22 (1977).Google Scholar
- 17.L.G. Valiant, “Relative Complexity of Checking and Evaluating, U. of Leeds Tech. Report, 1974.Google Scholar
- 18.L.G. Valiant, “The Complexity of Computing the Permanent,” TCS, (1979)Google Scholar
Index Terms
- Some connections between nonuniform and uniform complexity classes
Recommendations
Complexity of quantum uniform and nonuniform automata
DLT'05: Proceedings of the 9th international conference on Developments in Language TheoryWe present two different types of complexity lower bounds for quantum uniform automata (finite automata) and nonuniform automata (OBDDs). We call them “metric” and “entropic” lower bounds in according to proof technique used. We present explicit Boolean ...
Uniform Proof Complexity
We define the notion of the uniform reduct of a propositional proof system as the set of those bounded formulas in the language of Peano Arithmetic which have polynomial size proofs under the Paris-Wilkie-translation. With respect to the arithmetic ...
New non-uniform lower bounds for uniform classes
CCC '16: Proceedings of the 31st Conference on Computational ComplexityWe strengthen the nondeterministic hierarchy theorem for non-deterministic polynomial time to show that the lower bound holds against sub-linear advice. More formally, we show that for any constants d and d' such that 1 ≤ d < d', and for any time-...
Comments