3415 search results - page 131 / 683 » Lower Bounds for Kernelizations |
133
click to vote
CIE
2006
Springer
15 years 8 months ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
109
click to vote
DCC
2006
IEEE
16 years 4 months ago
2006
IEEE
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...
133
click to vote
SIROCCO
2008
15 years 5 months ago
2008
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms and presented an algorithm with three states for the problem of mutual exclusion on a ring of processors. ...
126
click to vote
DCC
2010
IEEE
15 years 4 months ago
2010
IEEE
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
126
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...