Symmetric Approximation Arguments for Monotone Lower Bounds without Sunflowers (1997)
by
Christer Berg
,
Staffan Ulfberg
| Venue: | Comput. Complexity |
| Citations: | 11 - 0 self |
BibTeX
@ARTICLE{Berg97symmetricapproximation,
author = {Christer Berg and Staffan Ulfberg},
title = {Symmetric Approximation Arguments for Monotone Lower Bounds without Sunflowers},
journal = {Comput. Complexity},
year = {1997},
volume = {8},
pages = {1--20}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 Sunflower lemma that has been essential for the method of approximation. The new approximation...
