Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication |
scientific article |
Statements
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (English)
0 references
20 October 2006
0 references
computational complexity
0 references
binary decision diagrams
0 references
branching programs
0 references
integer multiplication
0 references
lower bounds
0 references
parity nondeterminism
0 references
0 references
0 references
0 references
0 references
0 references
