Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,291,209 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.
2016
2016
On Limited Nondeterminism and ACC Circuit Lower Bounds
Holger Spakowski
Language and Automata Theory and Applications
2016
Corpus ID: 28386234
Williams’s celebrated circuit lower bound technique works by showing that the existence of certain small enough nonuniform…
Expand
Review
2016
Review
2016
Random oracles , the Polynomial-Time Hierarchy , and Constant-depth Circuits : A survey
A. 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
2012
2012
Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime
A. Kawamura
,
N. Müller
,
Carsten Rösnick
,
M. Ziegler
arXiv.org
2012
Corpus ID: 14816885
The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable…
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
2007
2007
A Time Hierarchy Theorem for Nondeterministic Cellular Automata
Chuzo Iwamoto
,
H. Yoneda
,
K. Morita
,
Katsunobu Imai
Theory and Applications of Models of Computation
2007
Corpus ID: 26269157
We present a tight time-hierarchy theorem for nondeterministic cellular automata by using a recursive padding argument. It is…
Expand
2005
2005
Properties of uniformly hard languages
Piotr Faliszewski
,
Janusz Jarosz
Information Processing Letters
2005
Corpus ID: 44522344
2003
2003
Tighter constant-factor time hierarchies
Amir M. Ben-Amram
Information Processing Letters
2003
Corpus ID: 32856754
1994
1994
Using bounded query classes to separate classes in the exponential time hierarchy from classes in PH
Sarah Mocas
Proceedings of IEEE 9th Annual Conference on…
1994
Corpus ID: 34620822
We are interested in separating classes in the exponential time hierarchy, EXPH, from classes in the polynomial time hierarchy…
Expand
1992
1992
New Time Hierarchy Results for Deterministic TMs
Krzysztof Lorys
Symposium on Theoretical Aspects of Computer…
1992
Corpus ID: 29445080
We show a method of maintaining a distributed counter by 2-dimensional deterministic Turing machines with at least two tapes. Our…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE