License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2016.36
URN: urn:nbn:de:0030-drops-63166
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6316/
Go to the corresponding LIPIcs Volume Portal

Cook, Stephen ; Edmonds, Jeff ; Medabalimi, Venkatesh ; Pitassi, Toniann

Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs

pdf-format:
LIPIcs-ICALP-2016-36.pdf (0.5 MB)

Abstract

We prove exponential lower bounds on the size of semantic read-once 3-ary nondeterministic branching programs. Prior to our result the best that was known was for D-ary branching programs with |D| >= 2^{13}.

BibTeX - Entry

@InProceedings{cook_et_al:LIPIcs:2016:6316,
  author =	{Stephen Cook and Jeff Edmonds and Venkatesh Medabalimi and Toniann Pitassi},
  title =	{{Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs}},
  booktitle =	{43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
  pages =	{36:1--36:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-013-2},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{55},
  editor =	{Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6316},
  URN =		{urn:nbn:de:0030-drops-63166},
  doi =		{10.4230/LIPIcs.ICALP.2016.36},
  annote =	{Keywords: Branching Programs, Semantic, Non-deterministic, Lower Bounds}
}

Keywords: Branching Programs, Semantic, Non-deterministic, Lower Bounds
Collection: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Issue Date: 2016
Date of publication: 23.08.2016

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