6 search results - page 1 / 2 » Time-Space Lower Bounds for the Polynomial-Time Hierarchy on... |
169
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
167
click to vote
JCSS
2000
15 years 4 months ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
164
Voted
COLT
2006
Springer
15 years 8 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
125
Voted
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
145
Voted
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...