Arithmetic Circuits: An Overview (Invited Talk)

Mahajan, Meena

doi:10.4230/LIPIcs.CSL.2017.5

Document

Arithmetic Circuits: An Overview (Invited Talk)

Author Meena Mahajan

Part of: Volume: 26th EACSL Annual Conference on Computer Science Logic (CSL 2017)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: Computer Science Logic (CSL)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2017-08-16

PDF

File

PDF

LIPIcs.CSL.2017.5.pdf

Filesize: 242 kB
1 pages

Document Identifiers

DOI: 10.4230/LIPIcs.CSL.2017.5
URN: urn:nbn:de:0030-drops-76858

Subject Classification

Keywords

algebraic complexity
circuits
formulas
branching programs
determinant
permanent

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

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.

Cite As Get 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) https://doi.org/10.4230/LIPIcs.CSL.2017.5

Author Details

Meena Mahajan

References

M. Mahajan. Algebraic complexity classes. In Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume, pages 51-75. Birkhäuser, 2014.
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: http://dx.doi.org/10.1007/s00224-016-9740-y.
Ramprasad Saptharishi. A survey of known lower bounds in arithmetic circuits. A continuously updated git survey. URL: https://github.com/dasarpmar/lowerbounds-survey.
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.

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