scientific article; zbMATH DE number 3847304

MaRDI QIDQ3317032zbMATH OpenFDO

Authors Gerard M. Baudet

Publication date 1983

zbMATH Keywords

Boolean functionscomplexity measureslower bounds on the complexity of VLSI circuitsVLSI design

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4043241
• scientific article; zbMATH DE number 3905849
• scientific article; zbMATH DE number 4051518
• scientific article; zbMATH DE number 4102489
• A model of computation for VLSI with related complexity results

Cited in

(11)

• The performance of multilective VLSI algorithms
• On the VLSI complexity of some arithmetic and numerical problems
• Trace theory and VLSI design
• The applicability of discrete performance estimation methods to VLSI design
• scientific article; zbMATH DE number 3898774 (Why is no real title available?)
• scientific article; zbMATH DE number 3919826 (Why is no real title available?)
• scientific article; zbMATH DE number 3922543 (Why is no real title available?)
• A model of computation for VLSI with related complexity results
• The VLSI Complexity of Selected Graph Problems
• scientific article; zbMATH DE number 4043241 (Why is no real title available?)
• scientific article; zbMATH DE number 4102489 (Why is no real title available?)

This page was built for publication:

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