Incremental branching programs

Authors:
Anna Gál;Michal Koucký;Pierre McKenzie
Affiliations:
University of Texas at Austin;Mathematical Institute, Prague, Czech Republic;Université de Montréal
Venue:
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Year:
2006

Citing 12
Cited 0

The complexity of Boolean functions

The complexity of Boolean functions
Monotone circuits for connectivity require super-logarithmic depth

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Oracle branching programs and logspace versus P

Information and Computation
On lower bounds for read-k-times branching programs

Computational Complexity
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Journal of the ACM (JACM)
Tight Lower Bounds for st-Connectivity on the NNJAG Model

SIAM Journal on Computing
Time-space tradeoffs for branching programs

Journal of Computer and System Sciences
Lower Bounds for Deterministic and Nondeterministic Branching Programs

FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
Comparative schematology

Record of the Project MAC conference on concurrent systems and parallel computation
Space bounds for graph connectivity problems on node-named JAGs and node-ordered JAGs

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences
An observation on time-storage trade off

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new model of restricted branching programs which we call incremental branching programs. We show that syntactic incremental branching programs capture previously studied structured 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 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.