Document Open Access Logo

Arithmetic Circuits: An Overview (Invited Talk)

Author Meena Mahajan

Thumbnail PDF


  • Filesize: 242 kB
  • 1 pages

Document Identifiers

Author Details

Meena Mahajan

Cite AsGet BibTex

Meena Mahajan. Arithmetic Circuits: An Overview (Invited Talk). In 26th EACSL Annual Conference on Computer Science Logic (CSL 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 82, p. 5:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)


This talk reviews recent developments in algebraic complexity theory. It outlines some major results concerning structure, completeness, closure, and lower bounds. It describes some techniques that have been central to obtaining these results, including extreme depth reduction, partial derivatives, and padding.
  • algebraic complexity
  • circuits
  • formulas
  • branching programs
  • determinant
  • permanent


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. M. Mahajan. Algebraic complexity classes. In Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume, pages 51-75. Birkhäuser, 2014. Google Scholar
  2. Meena Mahajan and Nitin Saurabh. Some complete and intermediate polynomials in algebraic complexity theory. Thory of Computing Systems, page to appear, 2017. (CSR special issue). URL:
  3. Ramprasad Saptharishi. A survey of known lower bounds in arithmetic circuits. A continuously updated git survey. URL:
  4. Amir Shpilka and Amir Yehudayoff. Arithmetic circuits: A survey of recent results and open questions. Foundations and Trends in Theoretical Computer Science, 5(3-4):207-388, 2010. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail