Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs

Abstract

Branching programs are a well-established computation model for boolean functions, especially read-once branching programs (BP1s) have been studied intensively. Recently two restricted nondeterministic (parity) BP1 models, called nondeterministic (parity) graphdriven BP1s and well-structured nondeterministic (parity) graph-driven BP1s, have been… (More)
DOI: 10.1007/3-540-36494-3_27

Topics

4 Figures and Tables

Slides referencing similar topics