Diagonal Circuit Identity Testing and Lower Bounds

Author Nitin Saxena



PDF
Thumbnail PDF

File

DagSemProc.07411.4.pdf
  • Filesize: 96 kB
  • 1 pages

Document Identifiers

Author Details

Nitin Saxena

Cite AsGet BibTex

Nitin Saxena. Diagonal Circuit Identity Testing and Lower Bounds. In Algebraic Methods in Computational Complexity. Dagstuhl Seminar Proceedings, Volume 7411, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/DagSemProc.07411.4

Abstract

In this talk we give a deterministic polynomial time algorithm for testing whether a {em diagonal} depth-$3$ circuit $C(arg{x}{n})$ (i.e. $C$ is a sum of powers of linear functions) is zero.
Keywords
  • Arithmetic circuit
  • identity testing
  • depth 3
  • depth 4
  • determinant
  • permanent
  • lower bound

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail