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. 1
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.