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

DOI10.1016/0890-5401(92)90046-IMaRDI QIDQ1121671zbMATH OpenFDO

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

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)

Recommendations

• scientific article; zbMATH DE number 61460
• scientific article; zbMATH DE number 4060726
• The performance of multilective VLSI algorithms
• scientific article; zbMATH DE number 4172378
• scientific article; zbMATH DE number 4102489

Cites work

• scientific article; zbMATH DE number 3858396 (Why is no real title available?)
• scientific article; zbMATH DE number 3987266 (Why is no real title available?)
• scientific article; zbMATH DE number 4047115 (Why is no real title available?)
• scientific article; zbMATH DE number 4051518 (Why is no real title available?)
• scientific article; zbMATH DE number 4060726 (Why is no real title available?)
• Modified branching programs and their computational power
• The performance of multilective VLSI algorithms

Cited in

(8)

• scientific article; zbMATH DE number 4172378 (Why is no real title available?)
• scientific article; zbMATH DE number 58305 (Why is no real title available?)
• scientific article; zbMATH DE number 61460 (Why is no real title available?)
• On the size of binary decision diagrams representing Boolean functions
• The performance of multilective VLSI algorithms
• A minimum-area circuit for \(\ell\)-selection
• On relations between counting communication complexity classes
• scientific article; zbMATH DE number 4060726 (Why is no real title available?)

This page was built for publication: Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121671)