Lower bounds for restricted read-once parity branching programs

Authors:
Matthias Homeister
Affiliations:
Institut für Numerische und Angewandte Mathematik, Georg-August-Universität Göttingen, Göttingen, Germany
Venue:
Theoretical Computer Science
Year:
2006

Citing 14
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication

IEEE Transactions on Computers
Graph driven BDDs—a new data structure for Boolean functions

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

Computational Complexity
Mod-2-OBDDs—a data structure that generalizes EXOR-sum-of-products and ordered binary decision diagrams

Formal Methods in System Design
On the combinatorics of finite words

Theoretical Computer Science
Linear codes are hard for oblivious read-once parity branching programs

Information Processing Letters
Symbolic manipulation of Boolean functions using a graphical representation

DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Branching programs and binary decision diagrams: theory and applications

Branching programs and binary decision diagrams: theory and applications
On the descriptive and algorithmic power of parity ordered binary decision diagrams

Information and Computation
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs

STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
A hierarchy result for read-once branching programs with restricted parity nondeterminism

Theoretical Computer Science - Mathematical foundations of computer science 2000

Quantified Score

Hi-index	5.23

Visualization

Abstract

We prove the first lower bounds for restricted read-once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to several orderings. Namely, sums of k graph-driven ⊕ BP1s with polynomial size graph-orderings are under consideration. We prove lower bounds for the characteristic function of linear codes. We generalize a lower bound by Savický and Sieling (see [P. Savický, D. Sieling, A hierarchy result for read-once Branching programs with restricted parity nondeterminism, Theoret. Comput. Sci. 340 (2005) 594-605]) and recent results on graph-driven parity branching programs.