539 search results - page 23 / 108 » An Improved Upper Bound for SAT |
MFCS
2004
Springer
14 years 26 days ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We address the problem of bounding below the probability of error under maximum-likelihood decoding of a binary code with a known distance distribution used on a binarysymmetric ch...
FOCS
1990
IEEE
13 years 11 months ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
ASIACRYPT
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. We apply autocorrelation and Walsh coefficients for the investigation of correlation immune and resilient Boolean functions. We prove new lower bound for the absolute ind...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
We present improved lower bounds on the sizes of small maximal partial ovoids in the classical hermitian polar spaces, and improved upper bounds on the sizes of large maximal part...