Sciweavers

3208 search results - page 128 / 642
» A Lower Bound for Primality
Sort
View
DCC
2006
IEEE
16 years 6 months ago
Asymptotic Nonlinearity of Boolean Functions
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...
François Rodier
SIROCCO
2008
15 years 7 months ago
On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion
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. ...
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
DCC
2010
IEEE
15 years 6 months ago
Minimum distance of Hermitian two-point codes
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...
Seungkook Park
MFCS
2007
Springer
16 years 17 days ago
Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs
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 ...
William Duckworth, Michele Zito
SAT
2005
Springer
115views Hardware» more  SAT 2005»
15 years 12 months ago
Improved Exact Solvers for Weighted Max-SAT
We present two new branch and bound weighted Max-SAT solvers (Lazy and Lazy ) which incorporate original data structures and inference rules, and a lower bound of better quality.
Teresa Alsinet, Felip Manyà, Jordi Planes