scientific article
From MaRDI portal
Publication:4009550
zbMath0746.68039MaRDI QIDQ4009550
Publication date: 27 September 1992
Full work available at URL: https://eudml.org/doc/27444
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
lower boundsbranching programsmodel of parallel computationsVLSI circuitarea complexity of the basic model of VLSI circuitsarea complexity of the multilective VLSI circuits
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Time-space trade-offs for branching programs
- A lower bound for read-once-only branching programs
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Bounds for Width Two Branching Programs
- Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
