Sciweavers

1380 search results - page 18 / 276
» A General Polynomial Sieve
Sort
View
JSC
2010
103views more  JSC 2010»
13 years 7 months ago
Bounds on absolute positiveness of multivariate polynomials
We propose a general framework for obtaining bounds on absolute positiveness of multivariate polynomials. We show that a known bound by Hong is a nearly optimal bound within this ...
Prashant Batra, Vikram Sharma
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
14 years 2 months ago
On solving hierarchical problems with top down control
We review recent work on the Hierarchical-If-And-Only-If problem and present a new hierarchical problem, HIFF-M that does not fit with previous explanations for evolutionary diffi...
Susan Khor
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 11 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
TOMS
2010
106views more  TOMS 2010»
13 years 7 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
COMBINATORICS
2006
96views more  COMBINATORICS 2006»
13 years 8 months ago
A New Statistic on Linear and Circular r-Mino Arrangements
We introduce a new statistic on linear and circular r-mino arrangements which leads to interesting polynomial generalizations of the r-Fibonacci and r-Lucas sequences. By studying...
Mark A. Shattuck, Carl G. Wagner