𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Ponzio, Stephen

Book ID
118177460
Publisher
Society for Industrial and Applied Mathematics
Year
1998
Tongue
English
Weight
458 KB
Volume
28
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A lower bound for read-once-only branchi
A lower bound for read-once-only branching programs
✍ LΓ‘szlΓ³ Babai; PΓ©ter Hajnal; Endre SzemerΓ©di; GyΓΆrgy TurΓ‘n πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 582 KB
A read-once lower bound and a (1,+k)-hie
A read-once lower bound and a (1,+k)-hierarchy for branching programs
✍ P. SavickΓ½; S. Ε½Γ‘k πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 143 KB

Branching programs (b. p.'s) or decision diagrams are a general graph-based model of sequential computation. The b. p.'s of polynomial size are a nonuniform counterpart of LOG. Lower bounds for di erent kinds of restricted b. p.'s are intensively investigated. An important restriction are the so-cal