2252 search results - page 24 / 451 » Lower Bounds for Dynamic Algorithms |
UMC
2000
13 years 11 months ago
2000
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
We prove that any Resolution proof for the weak pigeon hole principle, with n holes and any number of pigeons, is of length (2n ), (for some global constant > 0).
SODA
2010
ACM
14 years 5 months ago
2010
ACM
Let f1, f2, f3 : Fn 2 {0, 1} be three Boolean functions. We say a triple (x, y, x + y) is a triangle in
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We consider the following k-sparse recovery problem: design an m ? n matrix A, such that for any signal x, given Ax we can efficiently recover ^x satisfying
ALT
2010
Springer
13 years 9 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability