AbstractWe show that a deterministic Turing machine with one d-dimensional work tape and random access to the input cannot solve satisfiability in time na for a<(d+2)/(d+1). For conondeterministic machines, we obtain a similar lower bound for any a such that a3<1+a/(d+1). The same bounds apply to almost all natural NP-complete problems known
The following lower bounds for on-line computation are proved: (1) Simulating two-tape nondeterminis...
Abstr¡ct. wc prove optimal lower bounds on the computation time for several well-known test problems...
It is shown that the Element Distinctness Problem (n numbers of k log n bits each, k 2) on a one-t...
We show that a deterministic Turing machine with one d-dimensional work tape and random access to th...
We establish the first polynomial time-space lower bounds for satisfiability on general models of co...
AbstractWe give the first nontrivial model-independent time–space tradeoffs for satisfiability. Name...
We survey the recent lower bounds on the running time of general-purpose random-access machines tha...
We make several improvements on time lower bounds for concrete problems in NP and PH. 1. We present ...
AbstractThe arguments used by R. Kannan (1984, Math. Systems Theory17, 29–45), L. Fortnow (1997, in ...
We establish the first polynomial-strength time-space lower bounds for problems in the linear-time h...
For some problems, we know feasible algorithms for solving them. Other computational problems (such ...
We show that proving lower bounds in algebraic models of computation may not be easier than in the s...
This paper has two purposes. The first is to investigate the characteristics of a restricted class o...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
In this talk, we establish lower bounds for the running time of randomized machines with two-sided e...
The following lower bounds for on-line computation are proved: (1) Simulating two-tape nondeterminis...
Abstr¡ct. wc prove optimal lower bounds on the computation time for several well-known test problems...
It is shown that the Element Distinctness Problem (n numbers of k log n bits each, k 2) on a one-t...
We show that a deterministic Turing machine with one d-dimensional work tape and random access to th...
We establish the first polynomial time-space lower bounds for satisfiability on general models of co...
AbstractWe give the first nontrivial model-independent time–space tradeoffs for satisfiability. Name...
We survey the recent lower bounds on the running time of general-purpose random-access machines tha...
We make several improvements on time lower bounds for concrete problems in NP and PH. 1. We present ...
AbstractThe arguments used by R. Kannan (1984, Math. Systems Theory17, 29–45), L. Fortnow (1997, in ...
We establish the first polynomial-strength time-space lower bounds for problems in the linear-time h...
For some problems, we know feasible algorithms for solving them. Other computational problems (such ...
We show that proving lower bounds in algebraic models of computation may not be easier than in the s...
This paper has two purposes. The first is to investigate the characteristics of a restricted class o...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
In this talk, we establish lower bounds for the running time of randomized machines with two-sided e...
The following lower bounds for on-line computation are proved: (1) Simulating two-tape nondeterminis...
Abstr¡ct. wc prove optimal lower bounds on the computation time for several well-known test problems...
It is shown that the Element Distinctness Problem (n numbers of k log n bits each, k 2) on a one-t...
DOI
Add to ORKG