scientific article; zbMATH DE number 1564047

MaRDI QIDQ4528867zbMATH OpenFDO

Authors D. Yu. Cherukhin

Publication date 12 February 2001

zbMATH Keywords

complexitylower boundbasisBoolean functionformula

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited in

(4)

• A Lower Bound for the Formula Size of Rational Functions
• Upper bounds for the formula size of symmetric Boolean functions
• Average-case lower bounds for formula size
• On the meaning of works by V. M. Khrapchenko

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