MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity" – sorted by Relevance.

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

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

3 documents found, showing 1 through 3.

ATOM

Applications of Polynomial and Rational Approximation. . .
by Nicolas Frederick Reingold, K. Siu, V. Roychowdhury — 1992
… threshold circuits. Manuscript, 1992. [39] R. Smolensky. Algebraic methods in the theory of lower bounds…
Add To MetaCart

Algebraic and Descriptive Complexity of Combinatorial . . .
by J. von zur Gathen, J.A. Makowsky, M. Krynicki, M. Mostowski, L. W. Szczerba, Kluwer Academic — 1997
…, 1997. [Smo87] R. Smolensky. Algebraic methods in the theory of lower bounds for Boolean circuit…
Add To MetaCart

Effective Interpolation
by Jan Krajicek — 1997
…) Algebraic methods in the theory of lower bounds for Boolean circuit complexity, in: Proc. 19th Ann. ACM Symp…
Add To MetaCart

Showing 1 through 3.

ATOM

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