scientific article; zbMATH DE number 4061152

zbMATH Open0649.94021MaRDI QIDQ3795613FDOQ3795613

Authors: Stasys Jukna 

Publication date: 1988

Title of this publication is not available (Why is that?)

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

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)

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Lower bounds for Boolean circuits of bounded negation width
• A lower bound on circuit complexity of vector function in \(U _{2}\)
• Title not available (Why is that?)

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)