Sciweavers

486 search results - page 15 / 98
» Improved upper bounds for 3-SAT
Sort
View
JCSS
2008
80views more  JCSS 2008»
13 years 8 months ago
Improved bounds on sorting by length-weighted reversals
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
Michael A. Bender, Dongdong Ge, Simai He, Haodong ...
DCC
2006
IEEE
14 years 8 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
STACS
2009
Springer
14 years 3 months ago
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
Kenya Ueno
COMPGEOM
2010
ACM
14 years 1 months ago
On the complexity of sets of free lines and line segments among balls in three dimensions
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
Marc Glisse, Sylvain Lazard
WIOPT
2005
IEEE
14 years 2 months ago
Towards an Understanding of EASE and Its Properties
We propose a model under which several inherent properties of the Exponential Age SEarch routing protocol can be derived. By making simplifications on this model, we are able to ...
Stratis Ioannidis, Peter Marbach