License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.07411.4
URN: urn:nbn:de:0030-drops-13087
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1308/
Go to the corresponding Portal

Saxena, Nitin

Diagonal Circuit Identity Testing and Lower Bounds

pdf-format:
07411.SaxenaNitin.ExtAbstract.1308.pdf (0.09 MB)

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.

BibTeX - Entry

@InProceedings{saxena:DagSemProc.07411.4,
  author =	{Saxena, Nitin},
  title =	{{Diagonal Circuit Identity Testing and Lower Bounds}},
  booktitle =	{Algebraic Methods in Computational Complexity},
  pages =	{1--1},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7411},
  editor =	{Manindra Agrawal and Harry Buhrman and Lance Fortnow and Thomas Thierauf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2008/1308},
  URN =		{urn:nbn:de:0030-drops-13087},
  doi =		{10.4230/DagSemProc.07411.4},
  annote =	{Keywords: Arithmetic circuit, identity testing, depth 3, depth 4, determinant, permanent, lower bound}
}

Keywords: Arithmetic circuit, identity testing, depth 3, depth 4, determinant, permanent, lower bound
Collection: 07411 - Algebraic Methods in Computational Complexity
Issue Date: 2008
Date of publication: 22.01.2008

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI