Skip to main content
Article thumbnail
Location of Repository

On Small Size Approximation Models

By Er A. Razborov

Abstract

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

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.8978
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://people.cs.uchicago.edu/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.