3208 search results - page 263 / 642 » A Lower Bound for Primality |
188
click to vote
MST
2010
15 years 5 months ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
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...
153
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" ...
212
click to vote
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...