A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log <i>n</i> Negation Gates.

Kazuyuki Amano Akira Maruoka A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log <i>n</i> Negation Gates. 201-216 2005 35 SIAM J. Comput. 1 http://epubs.siam.org/SICOMP/volume-35/art_39695.html db/journals/siamcomp/siamcomp35.html#AmanoM05