Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication

Authors:
Beate Bollig
Affiliations:
-
Venue:
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Year:
2000

Citing 15
Cited 1

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
The complexity of Boolean functions

The complexity of Boolean functions
Meanders and their applications in lower bounds arguments

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Polynomial size &OHgr;-branching programs and their computational power

Information and Computation
On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication

IEEE Transactions on Computers
Time-space tradeoffs for integer multiplication on various types of input oblivious sequential machines

Information Processing Letters
Graph driven BDDs—a new data structure for Boolean functions

Theoretical Computer Science
On lower bounds for read-k-times branching programs

Computational Complexity
Communication complexity and parallel computing

Communication complexity and parallel computing
Communication complexity

Communication complexity
On separating the read-k-times branching program hierarchy

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Completeness and non-completeness results with respect to read-once projections

Information and Computation
A Lower Bound for Integer Multiplication with Read-Once Branching Programs

SIAM Journal on Computing
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's

IEEE Transactions on Computers
A Non-Linear Time Lower Bound for Boolean Branching Programs

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Branching programs are a well established computation model for Boolean functions, especially read-once branching programs have been studied intensively. In this paper the expressive power of nondeterministic read-once branching programs, i.e., the class of functions representable in polynomial size, is investigated. For that reason two restricted models of nondeterministic read-once branching programs are defined and a lower bound method is presented. Furthermore, the first exponential lower bound for integer multiplication on the size of a nondeterministic nonoblivious read-once branching program model is proven.