3415 search results - page 121 / 683 » Lower Bounds for Kernelizations |
121
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
144
click to vote
DLT
2009
15 years 2 months ago
2009
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
157
click to vote
TIT
2010
14 years 11 months ago
2010
A method for bounding the rate of bit-stuffing encoders for 2-D constraints is presented. Instead of considering the original encoder, we consider a related one which is quasistati...
158
click to vote
SWAT
2010
Springer
15 years 9 months ago
2010
Springer
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
131
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Let A be a self-adjoint operator acting over a space X endowed with a partition. We give lower bounds on the energy of a mixed state from its distribution in the partition and the...