scientific article; zbMATH DE number 3922538

MaRDI QIDQ3698702zbMATH OpenFDO

Authors G. S. Avsarkisyan

Publication date 1983

zbMATH Keywords

complexity of polynomial forms of partial Boolean functionsmulti-output logic circuitsrecurrent algorithmssystems of Boolean functions

Mathematics Subject Classification ID

Recommendations

• Publication:3470422
• Generalized polynomial forms of Boolean functions and design of multioutput logic circuits
• Complexity of Boolean functions in the class of polarized polynomial forms
• An upper bound for complexity of polynomial normal forms of Boolean functions
• On the complexity of realization of Boolean functions by formulas

Cited in

(10)

• Numerical computation of characteristic polynomials of Boolean functions and its applications
• On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials
• To the problem of expressibility in the algebra of partial Boolean functions
• Semi-regularity of pairs of Boolean polynomials
• scientific article; zbMATH DE number 4137717 (Why is no real title available?)
• scientific article; zbMATH DE number 4045649 (Why is no real title available?)
• scientific article; zbMATH DE number 1436990 (Why is no real title available?)
• An upper bound for complexity of polynomial normal forms of Boolean functions
• Polynomial decomposition of Boolean functions by images of homogeneous operators of nondegenerate functions
• Generalized polynomial forms of Boolean functions and design of multioutput logic circuits

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