Complexity of realization of underdetermined Boolean functions

MaRDI QIDQ2538856zbMATH OpenFDO

Authors Nikolay P. Red'kin

Publication date 1970

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/at10369

zbMATH Keywords

circuitsunderdetermined Boolean functions

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Recommendations

• scientific article; zbMATH DE number 4097290
• On complexity of schemes in incomplete bases
• Complexity of the realization of a linear Boolean function in the class of -schemes
• On the average-case complexity of underdetermined functions
• On the complexity of schemes in an infinite basis

Cited in

(2)

• The complexity of the realization of subdefinite matrices by gate schemes
• On the average-case complexity of underdetermined functions

This page was built for publication: Complexity of realization of underdetermined Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2538856)