Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,332,195 papers from all fields of science
Search
Sign In
Create Free Account
Time hierarchy theorem
Known as:
Nondeterministic time hierarchy
, Nondeterministic time hierarchy theorem
, Time hierarchy
In computational complexity theory, the time hierarchy theorems are important statements about time-bounded computation on Turing machines…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
27 relations
ACC0
Advice (complexity)
Cobham's thesis
Complexity class
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Formal Barriers to Proving P 6 = NP : Relativization and Natural Proofs One Anonymous
2019
Corpus ID: 109928149
The theoretical computer science community of the last century has continuously been stumped by a seemingly simple conjecture…
Expand
2017
2017
CMPT 407-Complexity Theory Lecture 4
Valentine Kabanets
2017
Corpus ID: 30203571
A Boolean circuit C on n inputs x1, . . . , xn is a directed acyclic graph (DAG) with n nodes of in-degree 0 (the inputs x1…
Expand
Review
2016
Review
2016
Random oracles , the Polynomial-Time Hierarchy , and Constant-depth Circuits : A survey
Andre He
,
Lisa Yang
2016
Corpus ID: 20415064
It has long been known that, relative to a random oracle, PH and PSPACE are separate with probability 1 [H̊as86]. We present the…
Expand
Review
2015
Review
2015
Nondeterministic Separations
L. Fortnow
Theory and Applications of Models of Computation
2015
Corpus ID: 45756705
We survey recent research on the power of nondeterministic computation and how to use nondeterminism to get new separations of…
Expand
2015
2015
Heuristic Time Hierarchies via Hierarchies for Sampling Distributions
D. Itsykson
,
Alexander Knop
,
Dmitry Sokolov
International Symposium on Algorithms and…
2015
Corpus ID: 9586074
We introduce a new framework for proving the time hierarchy theorems for heuristic classes. The main ingredient of our proof is a…
Expand
2014
2014
Lower Bounds for Heuristic Algorithms
Christoph Berkholz
2014
Corpus ID: 30166062
The constraint satisfaction problem, the Boolean satisfiability problem and the graph isomorphism problem do not have efficient…
Expand
2012
2012
On Certain Classes of Analytic and Univalent Functions Based on Al-Oboudi Operator
T. V. Sudharsan
,
S. Vijayalakshmi
2012
Corpus ID: 16330202
Following the works of [2, 4, 7, 9] of analytic and univalent functions in this paper we introduce two new classes…
Expand
2010
2010
An EXPSPACE Lower Bound
R. Lipton
2010
Corpus ID: 124072763
Albert Meyer, in the first decade of his career, was one of the top theorists in the world, yet you may not know his work in…
Expand
2009
2009
Time hierarchies for cryptographic function inversion with nonuniform advice
D. Grigoriev
2009
Corpus ID: 182434852
We prove a time hierarchy theorem for inverting functions computable in a slightly nonuniform polynomial time. In particular, we…
Expand
1996
1996
\structure and Complexity"
Eric Allender
,
K. Wagner
,
+6 authors
G. Wechsung
1996
Corpus ID: 17445622
S On the Power of Randomized Branching Programs Farid Ablayev Kazan University (joint work with Marek Karpinski, Universitat…
Expand