Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (2002)
| Venue: | In Proc. of 2nd TCS |
| Citations: | 5 - 3 self |
BibTeX
@INPROCEEDINGS{Bollig02paritygraph-driven,
author = {Beate Bollig and Stephan Waack},
title = {Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication},
booktitle = {In Proc. of 2nd TCS},
year = {2002},
pages = {83--94}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract Branching programs are a well-established computation model for boolean functions, especially read-once branching programs have been studied intensively. Exponential lower bounds for deterministic and nondeterministic read-once branching programs are known for a long time. On the other hand, the problem of proving superpolynomial lower bounds for parity read-once branching programs is still open. In this paper restricted parity read-once branching programs are considered and an exponential lower bound on the size of well-structured parity graph-driven read-once branching programs for integer multiplication is proven. This is the first strongly exponential lower bound on the size of a nonoblivious parity read-once branching program model for an explicitly defined boolean function. In addition, more insight into the structure of integer multiplication is yielded.
