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

Kazuyuki Amano, Akira Maruoka. A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log ::::n:::: Negation Gates. SIAM Journal on Computing, 35(1):201-216, 2005. [doi]

Authors

Kazuyuki Amano

This author has not been identified. Look up 'Kazuyuki Amano' in Google

Akira Maruoka

This author has not been identified. Look up 'Akira Maruoka' in Google