3415 search results - page 332 / 683 » Lower bounds on kernelization |
171
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
187
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
178
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...
179
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract-- Optimal communication/control analysis and design of dynamical controlled systems, when there are finite capacity communication constraints often involve information and...
162
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...