Gál, Anna ;
McKenzie, Pierre ;
Koucký, Michal
Incremental branching programs
Abstract
We propose a new model of restricted branching programs
which we call {em incremental branching programs}.
We show that {em syntactic}
incremental branching programs capture previously studied
structured models of computation for the problem GEN, namely marking
machines [Cook74].
and Poon's extension [Poon93] of jumping automata
on graphs [CookRackoff80].
We then prove
exponential size lower bounds for our syntactic incremental model,
and for some other restricted branching program models as well.
We further show that nondeterministic syntactic incremental
branching programs are
provably stronger than their deterministic counterpart when solving a
natural NL-complete GEN subproblem.
It remains open if syntactic incremental branching programs are as powerful
as unrestricted branching programs for GEN problems.
Joint work with Anna Gál and Michal Koucký
BibTeX - Entry
@InProceedings{gal_et_al:DagSemProc.06111.10,
author = {G\'{a}l, Anna and McKenzie, Pierre and Kouck\'{y}, Michal},
title = {{Incremental branching programs}},
booktitle = {Complexity of Boolean Functions},
pages = {1--20},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2006/623},
URN = {urn:nbn:de:0030-drops-6230},
doi = {10.4230/DagSemProc.06111.10},
annote = {Keywords: Complexity theory, branching programs, logarithmic space, marking machines}
}
|
Keywords: |
|
Complexity theory, branching programs, logarithmic space, marking machines |
|
Seminar: |
|
06111 - Complexity of Boolean Functions
|
|
Issue date: |
|
2006 |
|
Date of publication: |
|
30.11.2006 |
30.11.2006
