Sciweavers

537 search results - page 17 / 108
» A new upper bound for 3-SAT
Sort
View
CPM
2010
Springer
140views Combinatorics» more  CPM 2010»
14 years 1 months ago
Bounds on the Minimum Mosaic of Population Sequences under Recombination
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
Yufeng Wu
ECCC
2010
108views more  ECCC 2010»
13 years 5 months ago
Improved bounds for the randomized decision tree complexity of recursive majority
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
Frédéric Magniez, Ashwin Nayak, Mikl...
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 8 months ago
Coloring translates and homothets of a convex body
We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of fini...
Adrian Dumitrescu, Minghui Jiang
APPML
2006
81views more  APPML 2006»
13 years 8 months ago
On the nonlinearity of linear recurrence sequences
We obtain an upper bound on a new type of exponential sums with linear recurrence sequences. We apply this bound to estimate the Fourier coefficients, and thus the nonlinearity, o...
Igor Shparlinski, Arne Winterhof
MOC
2002
83views more  MOC 2002»
13 years 8 months ago
A posteriori error estimates for general numerical methods for Hamilton-Jacobi equations. Part I: The steady state case
A new upper bound is provided for the L-norm of the difference between the viscosity solution of a model steady state Hamilton-Jacobi equation, u, and any given approximation, v. T...
Samuel Albert, Bernardo Cockburn, Donald A. French...