scientific article; zbMATH DE number 1746570

MaRDI QIDQ4530739zbMATH OpenFDO

Authors D. Yu. Cherukhin

Publication date 28 May 2002

zbMATH Keywords

basisBoolean functioncomplexityformulalower bound

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1855658
• Realization of Boolean functions by repetition-free formulas in a particular base
• On realization of Boolean functions by repetition-free formulas
• On the complexity of realization of the linear function by formulas over finite Boolean bases
• On the complexity of realizing the powers of a Boolean (n,n)-function

Cited in

(5)

• On the computational complexity of some classical equivalence relations on boolean functions
• Formula Complexity of Ternary Majorities
• scientific article; zbMATH DE number 1498465 (Why is no real title available?)
• scientific article; zbMATH DE number 1855658 (Why is no real title available?)
• Computational complexity of quantified Boolean formulas with fixed maximal deficiency

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