## A Criterion for Monotone Circuit Complexity (1991)

Citations: | 5 - 2 self |

### BibTeX

@TECHREPORT{Jukna91acriterion,

author = {Stasys Jukna},

title = {A Criterion for Monotone Circuit Complexity},

institution = {},

year = {1991}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper we study the lower bounds problem for monotone circuits. The main goal is to extend and simplify the well known method of approximations proposed by A. Razborov in 1985. The main result is the following combinatorial criterion for the monotone circuit complexity: a monotone Boolean function f(X) of n variables X = fx 1 ; : : : ; x n g requires monotone circuits of size exp(\Omega\Gamma t= log t)) if there is a family F ` 2 X such that: (i) each set in F is either a minterm or a maxterm of f; and (ii) D k (F)=D k+1 (F) t for every k = 0; 1; : : : ; t \Gamma 1: Here D k (F) is the k-th degree of F , i.e. maximum cardinality of a subfamily H ` F with j " Hj k: 1 Introduction The question of determining how much economy the universal non-monotone basis f; ; :g provides over the monotone basis f; g has been a long standing open problem in Boolean circuit complexity. In 1985, Razborov [10, 11] achieved a major development in this direction. He worked out the, so-called,...