In this paper we continue the study of the method of approximations in Boolean complexity. We introduce a framework which naturally generalizes previously known ones. The main result says that in this framework there exist approximation models providing in principle exponential lower bounds for almost all Boolean functions, and such that the number of testing functionals is only singly exponential in the number of variables.
CITATION STYLE
Razborov, A. A. (2013). On small size approximation models. In The Mathematics of Paul Erdos I, Second Edition (pp. 425–433). Springer New York. https://doi.org/10.1007/978-1-4614-7258-2_26
Mendeley helps you to discover research relevant for your work.