Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits

DOI10.1016/0890-5401(92)90046-IzbMath0674.68033MaRDI QIDQ1121671

Juraj Hromkovič, Stephan Waack, Matthias Krause, Christoph Meinel

Publication date: 1990

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

computational complexitylower boundsbranching programsmultilective VLSI circuits

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Complexity of computation (including implicit computational complexity) (03D15) Theory of operating systems (68N25)

Related Items

On relations between counting communication complexity classes ⋮ On the size of binary decision diagrams representing Boolean functions

Cites Work

• The performance of multilective VLSI algorithms
• Modified branching programs and their computational power
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item