License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CCC.2017.32
URN: urn:nbn:de:0030-drops-75128
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7512/
Go to the corresponding LIPIcs Volume Portal


Minahan, Daniel ; Volkovich, Ilya

Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas

pdf-format:
LIPIcs-CCC-2017-32.pdf (0.5 MB)


Abstract

In this paper we study the identity testing problem of arithmetic read-once formulas (ROF) and some related models. A read-once formula is formula (a circuit whose underlying graph is a tree) in which the operations are {+,x} and such that every input variable labels at most one leaf. We obtain the first polynomial-time deterministic identity testing algorithm that operates in the black-box setting for read-once formulas, as well as some other related models. As an application, we obtain the first polynomial-time deterministic reconstruction algorithm for such formulas. Our results are obtained by improving and extending the analysis of the algorithm of [Shpilka-Volkovich, 2015]

BibTeX - Entry

@InProceedings{minahan_et_al:LIPIcs:2017:7512,
  author =	{Daniel Minahan and Ilya Volkovich},
  title =	{{Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas}},
  booktitle =	{32nd Computational Complexity Conference (CCC 2017)},
  pages =	{32:1--32:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-040-8},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{79},
  editor =	{Ryan O'Donnell},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7512},
  URN =		{urn:nbn:de:0030-drops-75128},
  doi =		{10.4230/LIPIcs.CCC.2017.32},
  annote =	{Keywords: Derandomization, Read-Once Formulas, Identity Testing, Arithmetic Circuits, Reconstruction}
}

Keywords: Derandomization, Read-Once Formulas, Identity Testing, Arithmetic Circuits, Reconstruction
Seminar: 32nd Computational Complexity Conference (CCC 2017)
Issue Date: 2017
Date of publication: 21.07.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI