Journal Article10.1145/322047.322061
Separating Nondeterministic Time Complexity Classes
TL;DR: The strongest known dmgonalization results for both deterministic and nondetermlmstlc time complexity classes are reviewed and orgamzed for comparison with the results of the new padding technique.
read more
Abstract: AaSTancr. A recurslve padding technique is used to obtain conditions sufficient for separation of nondetermlmsttc multltape Turlng machine time complexity classes If T2 is a running time and Tl(n + 1) grows more slowly than T~(n), then there is a language which can be accepted nondetermmlstlcally within time bound T~ but which cannot be accepted nondetermlnlStlcally within time bound T1. If even T~(n + f(n)) grows more slowly than Tz(n), where f is the very slowly growing "rounded reverse" of some real-time countable function, then there is such a language over a single-letter alphabet. The strongest known dmgonalization results for both deterministic and nondetermlmstlc time complexity classes are reviewed and orgamzed for comparison with the results of the new padding technique
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A catalog of complexity classes
David S. Johnson
- 02 Jan 1991
TL;DR: This chapter discusses the concepts needed for defining the complexity classes, a set of problems of related resource-based complexity that can be solved by an abstract machine M using O(f(n) of resource R, where n is the size of the input.
638
Non-deterministic exponential time has two-prover interactive protocols
TL;DR: It is shown that the class of languages having tow-prover interactive proof systems is nondeterministic exponential time and that to prove membership in languages inEXP, the honest provers need the power ofEXP only.
Nondeterministic exponential time has two-prover interactive protocols
László Babai,Lance Fortnow,Carsten Lund +2 more
- 22 Oct 1990
TL;DR: It is shown that the class of languages having two-prover interactive proof systems is computable in nondeterministic exponential time (NEXP), which represents a further step demonstrating the unexpectedly immense power for randomization and interaction in efficient provability.
308
Nonuniform ACC Circuit Lower Bounds
TL;DR: The high-level strategy is to design faster algorithms for the circuit satisfiability problem over ACC circuits, then prove that such algorithms entail these lower bounds, while the second step requires a strengthening of the author’s prior work.
•Book
Complexity Theory: Exploring the Limits of Efficient Algorithms
Ingo Wegener,R. Pruim +1 more
- 01 Dec 2005
TL;DR: These topics are considered from an algorithmic point of view stressing the implications for algorithm design.
240
References
•Book
Theory of Recursive Functions and Effective Computability
Jr. Hartley Rogers
- 22 Apr 1987
TL;DR: In this paper, the authors discuss related theories of recursively enumerable sets, degree of un-solvability and turing degrees in particular, and generalizations of recursion theory.
1.9K
On the computational complexity of algorithms
TL;DR: In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the string.
Word problems requiring exponential time(Preliminary Report)
L. J. Stockmeyer,A. R. Meyer +1 more
- 30 Apr 1973
TL;DR: A number of similar decidable word problems from automata theory and logic whose inherent computational complexity can be precisely characterized in terms of time or space requirements on deterministic or nondeterministic Turing machines are considered.
A Machine-Independent Theory of the Complexity of Recursive Functions
TL;DR: The number of steps required to compute a function depends on the type of computer that is used, on the choice of computer program, and on the input-output code, but the results obtained in this paper are nearly independent of these considerations.
816