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

DOI10.1016/0890-5401(92)90046-IzbMATH Open0674.68033MaRDI QIDQ1121671FDOQ1121671

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

Publication date: 1990

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The performance of multilective VLSI algorithms
• Modified branching programs and their computational power
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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

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)