Sciweavers

CSR
2006
Springer

Incremental Branching Programs

14 years 3 months ago
Incremental Branching Programs
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branching programs capture previously studied models of computation for the problem GEN, namely marking machines [Co74] and Poon's extension [Po93] of jumping automata on graphs [CoRa80]. We then prove exponential size lower bounds for our syntactic incremental model, and for some other variants of branching program computation for GEN. 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.
Anna Gál, Michal Koucký, Pierre McKe
Added 22 Aug 2010
Updated 22 Aug 2010
Type Conference
Year 2006
Where CSR
Authors Anna Gál, Michal Koucký, Pierre McKenzie
Comments (0)