Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,268,536 papers from all fields of science
Search
Sign In
Create Free Account
Random-access Turing machine
In computational complexity, a field of computer science, random-access Turing machines are an extension of Turing machines used to speak about small…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Computational complexity theory
Computer science
DLOGTIME
LH (complexity)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Descriptive Complexity of Deterministic Polylogarithmic Time
Flavio Ferrarotti
,
Senén González
,
José Maria Turull Torres
,
J. V. D. Bussche
,
Jonni Virtema
Workshop on Logic, Language, Information and…
2019
Corpus ID: 72940960
We propose a logical characterization of problems solvable in deterministic polylogarithmic time (\(\mathrm {PolylogTime}\)). We…
Expand
Highly Cited
2005
Highly Cited
2005
Time-space lower bounds for satisfiability
L. Fortnow
,
R. Lipton
,
D. Melkebeek
,
Anastasios Viglas
JACM
2005
Corpus ID: 132926
We establish the first polynomial time-space lower bounds for satisfiability on general models of computation. We show that for…
Expand
2000
2000
Time-space tradeoffs for nondeterministic computation
L. Fortnow
,
D. Melkebeek
Proceedings 15th Annual IEEE Conference on…
2000
Corpus ID: 2129433
We show new tradeoffs for satisfiability and nondeterministic linear time. Satisfiability cannot be solved on general purpose…
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