Inversion complexity of self-correcting circuits for a certain sequence of Boolean functions

DOI10.3103/S0027132212030102MaRDI QIDQ355279zbMATH OpenFDO

Authors T. I. Krasnova

Publication date 24 July 2013

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

Mathematics Subject Classification ID

Analytic circuit theory (94C05)

Recommendations

• scientific article; zbMATH DE number 942481
• Complexity of self-correcting circuits for some sequence of Boolean functions
• scientific article; zbMATH DE number 1285548
• scientific article; zbMATH DE number 1285549
• On asymptotically minimal self-correcting schemes for a sequence of Boolean functions

Cites work

• scientific article; zbMATH DE number 4217938 (Why is no real title available?)
• Asymptotically minimal schemes for one sequence of Boolean functions

Cited in

(3)

• Complexity of self-correcting circuits for some sequence of Boolean functions
• The conjunction complexity asymptotic of self-correcting circuits for monotone symmetric functions with threshold 2
• scientific article; zbMATH DE number 942481 (Why is no real title available?)

This page was built for publication: Inversion complexity of self-correcting circuits for a certain sequence of Boolean functions

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