MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Amir Shpilka" – sorted by Relevance.

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

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

24 documents found, showing 1 through 10. Next 10 →

ATOM

Affine Projections of Symmetric Polynomials
by Amir Shpilka — 2001 — In Proc. 16th Annual IEEE Conference on Computational Complexity
…Affine Projections of Symmetric Polynomials Amir Shpilka Institute of Computer Science Hebrew…
Cited by 1 (0 self) – Add To MetaCart

Interpolation of depth-3 arithmetic circuits with two multiplication gates
by Amir Shpilka — 2007 — In STOC ’07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
…Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates ∗ Amir Shpilka † June…
Cited by 2 (0 self) – Add To MetaCart

Lower Bounds for Matrix Product
by Amir Shpilka — SIAM Journal on Computing
…Lower Bounds for Matrix Product Amir Shpilka Institute of Computer Science Hebrew University…
Cited by 16 (2 self) – Add To MetaCart

Lower Bounds for Matrix Product, in Bounded Depth Circuits with Arbitrary Gates
by Ran Raz, Amir Shpilka — 2001 — In Proceedings of the thirty-third annual ACM symposium on Theory of computing
…Lower Bounds for Matrix Product, in Bounded Depth Circuits with Arbitrary Gates Ran Raz Amir…
Cited by 14 (6 self) – Add To MetaCart

Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
by Zeev Dvir, Amir Shpilka — 2005 — SIAM J. on Computing
… Dvir ∗ Amir Shpilka † Abstract In this work we study two, seemingly unrelated, notions. Locally…
Cited by 10 (3 self) – Add To MetaCart

Deterministic polynomial identity testing in non commutative models
by Ran Raz, Amir Shpilka — 2004 — Computational Complexity
…Deterministic Polynomial Identity Testing in Non Commutative Models Ran Raz ∗ Amir Shpilka…
Cited by 11 (6 self) – Add To MetaCart

Depth-3 Arithmetic Circuits over Fields of Characteristic Zero
by Amir Shpilka, Avi Wigderson — 1999 — Computational Complexity
…Depth-3 Arithmetic Circuits over Fields of Characteristic Zero Amir Shpilka y Avi Wigderson z…
Cited by 8 (2 self) – Add To MetaCart

On the Power of Quantum Proofs
by Ran Raz, Amir Shpilka — 2004 — In Proc. IEEE Conference on Computational Complexity
…On the power of Quantum Proofs Ran Raz Amir Shpilka y Abstract We study the power of quantum…
Cited by 5 (0 self) – Add To MetaCart

Locally decodable codes with two queries and polynomial identity testing for depth 3 circuits
by Zeev Dvir, Amir Shpilka — 2007 — SIAM J. Comput
… † AND AMIR SHPILKA ‡ Abstract. In this work we study two, seemingly unrelated, notions. Locally decodable…
Cited by 2 (0 self) – Add To MetaCart

Depth-3 arithmetic formulae over fields of characteristic zero
by Amir Shpilka, Avi Wigderson — 1999 — In CCC
…Depth-3 Arithmetic Formulae over Fields of Characteristic Zero Amir Shpilka Avi Wigderson…
Cited by 7 (3 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

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