Which formulae shrink under random restrictions?
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A characterization of span program size and improved lower bounds for monotone span programs
Computational Complexity
Combinatorics, Probability and Computing
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
Smallest Formulas for Parity of 2k Variables Are Essentially Unique
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Limiting Negations in Formulas
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Amplifying lower bounds by means of self-reducibility
Journal of the ACM (JACM)
Theoretical Computer Science
A new rank technique for formula size lower bounds
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Note: Smallest formulas for the parity of 2 k variables are essentially unique
Theoretical Computer Science
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
Cracks in the defenses: scouting out approaches on circuit lower bounds
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Breaking the rectangle bound barrier against formula size lower bounds
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Uniform derandomization from pathetic lower bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A stronger LP bound for formula size lower bounds via clique constraints
Theoretical Computer Science
Average-case lower bounds for formula size
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Exponential separations in a hierarchy of clause learning proof systems
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
We prove that if we hit a de Morgan formula of size L with a random restriction from Rp, then the expected remaining size is at most $O(p^2(\log \frac {1}{p})^{3/2}L+p\sqrt L)$. As a corollary we obtain an $\Omega(n^{3-o(1)})$-formula-size lower bound for an explicit function in P. This is the strongest known lower bound for any explicit function in NP.