179 search results - page 13 / 36 » Alternation-Trading Proofs, Linear Programming, and Lower Bo... |
TCS
2011
13 years 2 months ago
2011
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
IPCO
2010
13 years 5 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
JCSS
2000
13 years 7 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...