scientific article; zbMATH DE number 4208009

MaRDI QIDQ3356246zbMATH OpenFDO

Authors V. A. Stetsenko

Publication date 1989

zbMATH Keywords

Boolean functionsdegree lower boundsformula complexity

Mathematics Subject Classification ID

Recommendations

• On almost bad Boolean bases
• Lower bounds on the formula complexity of a linear Boolean function
• scientific article; zbMATH DE number 176870
• scientific article; zbMATH DE number 3867233
• scientific article; zbMATH DE number 1746571

Cited in

(7)

• Applications of matrix methods to the theory of lower bounds in computational complexity
• Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation
• scientific article; zbMATH DE number 3867233 (Why is no real title available?)
• A Gödel Theorem on Network Complexity Lower Bounds
• scientific article; zbMATH DE number 139642 (Why is no real title available?)
• scientific article; zbMATH DE number 176870 (Why is no real title available?)
• A simplified proof of a lower complexity estimate

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 Q3356246)