Searching for "Lower bounds for circuits with MOD_m 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.

Query-efficient algorithms for polynomial interpolation over composites
by Parikshit Gopalan — 2006 — In Proceedings of the ACM-SIAM Sympsoium on Discrete algorithms (SODA
… in complexity theory is to show lower bounds for circuits with Mod-m gates. Motivated by this problem…
Cited by 4 (2 self) – Add To MetaCart

Showing 1 through 1.

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