Abstract.
We propose a symmetric version of Razborov's method of approximation to prove lower bounds for monotone circuit complexity. Traditionally, only DNF formulas have been used as approximators, whereas we use both CNF and DNF formulas. As a consequence we no longer need the Sun ower Lemma that has been essential for the method of approximation. The new approximation argument corresponds to Haken's recent method for proving lower bounds for monotone circuit complexity (counting bottlenecks) in a natural way.¶We provide lower bounds for the BMS problem introduced by Haken, Andreev's polynomial problem, and for Clique. The exponential bounds obtained are the same as those previously best known for the respective problems.
Author information
Authors and Affiliations
Additional information
Received: July 16, 1996.
Rights and permissions
About this article
Cite this article
Berg, C., Ulfberg, S. Symmetric approximation arguments for monotone lower bounds without sunflowers. Comput. complex. 8, 1–20 (1999). https://doi.org/10.1007/s000370050017
Issue Date:
DOI: https://doi.org/10.1007/s000370050017