✦ LIBER ✦

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

✍ Scribed by Beate Bollig; Philipp Woelfel

Book ID: 105914753
Publisher: Springer
Year: 2004
Tongue: English
Weight: 232 KB
Volume: 38
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-004-1130-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parity graph-driven read-once branching

Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication

✍ Beate Bollig; Stephan Waack; Philipp Woelfel 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 276 KB

A Lower Bound for Integer Multiplication

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

✍ Ponzio, Stephen 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 458 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