eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2018-07-04
22:1
22:12
10.4230/LIPIcs.ICALP.2018.22
article
Small Bias Requires Large Formulas
Bogdanov, Andrej
1
Department of Computer Science and Engineering and , Institute of Theoretical Computer Science and Communications, Chinese University of Hong Kong.
A small-biased function is a randomized function whose distribution of truth-tables is small-biased. We demonstrate that known explicit lower bounds on (1) the size of general Boolean formulas, (2) the size of De Morgan formulas, and (3) correlation against small De Morgan formulas apply to small-biased functions. As a consequence, any strongly explicit small-biased generator is subject to the best-known explicit formula lower bounds in all these models.
On the other hand, we give a construction of a small-biased function that is tight with respect to lower bound (1) for the relevant range of parameters. We interpret this construction as a natural-type barrier against substantially stronger lower bounds for general formulas.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol107-icalp2018/LIPIcs.ICALP.2018.22/LIPIcs.ICALP.2018.22.pdf
formula lower bounds
natural proofs
pseudorandomness