logo
http://theoryofcomputing.org     ISSN 1557-2862
Endorsed by ACM SIGACT
  • Home
  • Introduction
  • Articles
  • Library
  • Editors
  • Submit
  • Issues
  • Contact Us
  • Search
Articles under category:
Polynomials
Volume 7, Article 13 (pages 185-188) [NOTE]
Computing Polynomials with Few Multiplications
by Shachar Lovett
Volume 7, Article 1 (pages 1-18)
Noisy Interpolating Sets for Low-Degree Polynomials
by Zeev Dvir and Amir Shpilka
Volume 6, Article 7 (pages 135-177)
Elusive Functions and Lower Bounds for Arithmetic Circuits
by Ran Raz
Volume 5, Article 3 (pages 69-82)
Unconditional Pseudorandom Generators for Low Degree Polynomials
by Shachar Lovett
Volume 4, Article 7 (pages 137-168)
Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols
by Emanuele Viola and Avi Wigderson
Volume 2, Article 6 (pages 121-135)
Separation of Multilinear Circuit and Formula Size
by Ran Raz
Volume 1, Article 3 (pages 37-46)
Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range
by Andris Ambainis
ToC Library Graduate Surveys 2 (2011) 54 pages
Quantum Proofs for Classical Theorems
by Andrew Drucker and Ronald de Wolf