scientific article; zbMATH DE number 4061152

MaRDI QIDQ3795613zbMATH OpenFDO

Authors Stasys Jukna

Publication date 1988

zbMATH Keywords

monotone circuitscomplexity of combinational circuitsnon-monotone Boolean functionsthree-valued functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analytic circuit theory (94C05)

Recommendations

• scientific article; zbMATH DE number 4170847
• scientific article; zbMATH DE number 4049557
• On bounds for complexity of circuits of multi-input functional elements
• Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
• Lower bounds on the area complexity of Boolean circuits

Cited in

(5)

• scientific article; zbMATH DE number 176870 (Why is no real title available?)
• scientific article; zbMATH DE number 4170847 (Why is no real title available?)
• Lower bounds for Boolean circuits of bounded negation width
• A lower bound on circuit complexity of vector function in \(U _{2}\)
• scientific article; zbMATH DE number 3987204 (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 Q3795613)