Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

JCT
2008

favoriteEmaildiscussreport

83views more JCT 2008»

Bounds on degrees of p-adic separating polynomials

13 years 4 months ago

Bounds on degrees of p-adic separating polynomials

Download www.math.ucla.edu

We study a discrete optimization problem introduced by Babai, Frankl, Kutin, and Stefankovic (2001), which provides bounds on degrees of polynomials with p-adically controlled behavior. Such polynomials are of particular interest because they furnish bounds on the size of set systems satisfying Frankl

Daniel J. Katz, Joshua Zahl

Real-time Traffic

Discrete Optimization Problem | JCT 2008 | Optimization Problem | Polynomials |

claim paper

Related Content

» The DMM bound multivariate aggregate separation bounds

» Polynomial Vicinity Circuits and Nonlinear Lower Bounds

» Hardness Amplification in Proof Complexity

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JCT
Authors	Daniel J. Katz, Joshua Zahl

Comments (0)