License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-13087
URL: http://drops.dagstuhl.de/opus/volltexte/2008/1308/

Saxena, Nitin

Diagonal Circuit Identity Testing and Lower Bounds

pdf-format:
Dokument 1.pdf (97 KB)


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:DSP:2008:1308,
  author =	{Nitin Saxena},
  title =	{Diagonal Circuit Identity Testing and Lower Bounds},
  booktitle =	{Algebraic Methods in Computational Complexity},
  year =	{2008},
  editor =	{Manindra Agrawal and Harry Buhrman and Lance Fortnow and Thomas Thierauf},
  number =	{07411},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1308},
  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
Seminar: 07411 - Algebraic Methods in Computational Complexity
Issue date: 2008
Date of publication: 22.01.2008


DROPS-Home | Fulltext Search | Imprint Published by LZI