3415 search results - page 285 / 683 » Lower bounds on kernelization |
203
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
155
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A new fast (real time) sorter of binary numbers by one-dimensional cellular automata is proposed. It sorts a list of n numbers represented by k-bits each in exactly nk steps. This ...
170
click to vote
TIT
2010
15 years 1 months ago
2010
A new variable-rate coding technique is presented for two-dimensional constraints. For certain constraints, such as the (0, 2)-RLL, (2, )-RLL, and the "no isolated bits" ...
215
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Unique-sink orientations (USOs) are an abstract class of orientations of the ncube graph. We consider some classes of USOs that are of interest in connection with the linear compl...
168
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...