425 search results - page 65 / 85 » Polynomial Factorization 1987-1991 |
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We show that any k-wise independent probability distribution on {0, 1}n O(m2.22− √ k/10)fools any boolean function computable by an m-clause DNF (or CNF) formula on n variable...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. We can eliminate such value symmetr...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We consider a revenue maximization problem where we are selling a set of comparable items, each available in a certain quantity (possibly unlimited) to a set of bidders. Each bidde...