Searching for "A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6) log
by Kazuyuki Amano, Akira Maruoka — 1998 — SIAM J. Comput
…A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (#/#) log…
Cited by 5 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB