Back to Search
Start Over
Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound
- Source :
- SIAM Journal on Computing. 46:37-57
- Publication Year :
- 2017
- Publisher :
- Society for Industrial & Applied Mathematics (SIAM), 2017.
-
Abstract
- We give an explicit function $h:\{0,1\}^n \to \{0,1\}$ such that every de Morgan formula of size $n^{3-o(1)}/r^2$ agrees with $h$ on at most a fraction of $\frac{1}{2}+2^{-\Omega(r)}$ of the inputs. Our technical contributions include a theorem that shows that the “expected shrinkage” result of H\aastad [SIAM J. Comput., 27 (1998), pp. 48--64] actually holds with very high probability (where the restrictions are chosen from a certain distribution that takes into account the structure of the formula), using ideas of Impagliazzo, Meka, and Zuckerman [Proceedings of FOCS, 2012, pp. 111--119].
- Subjects :
- High probability
General Computer Science
Implicit function
General Mathematics
010102 general mathematics
Structure (category theory)
0102 computer and information sciences
01 natural sciences
Omega
Upper and lower bounds
Size matching
Combinatorics
Distribution (mathematics)
010201 computation theory & mathematics
Fraction (mathematics)
0101 mathematics
Mathematics
Subjects
Details
- ISSN :
- 10957111 and 00975397
- Volume :
- 46
- Database :
- OpenAIRE
- Journal :
- SIAM Journal on Computing
- Accession number :
- edsair.doi...........06762ffb26669c08ef975d1ac6930638
- Full Text :
- https://doi.org/10.1137/15m1048045