The conjunction complexity asymptotic of self-correcting circuits for monotone symmetric functions with threshold 2

DOI10.3103/S0027132214030061MaRDI QIDQ2018031zbMATH OpenFDO

Authors T. I. Krasnova

Publication date 24 March 2015

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

Mathematics Subject Classification ID

Analytic circuit theory (94C05)

Recommendations

• Complexity of self-correcting circuits for some sequence of Boolean functions
• scientific article; zbMATH DE number 942481
• On the complexity of monotone circuits for threshold symmetric Boolean functions
• Inversion complexity of self-correcting circuits for a certain sequence of Boolean functions
• On asymptotically minimal self-correcting schemes for a sequence of Boolean functions

Cites work

• scientific article; zbMATH DE number 609922 (Why is no real title available?)
• scientific article; zbMATH DE number 942481 (Why is no real title available?)
• Inversion complexity of self-correcting circuits for a certain sequence of Boolean functions
• Reliability and diagnostics of circuits

Cited in

(2)

• On Lyapunov type inequalities for symmetric functions
• Inequalities for s-th means function of order k

This page was built for publication: The conjunction complexity asymptotic of self-correcting circuits for monotone symmetric functions with threshold 2

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