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

DOI10.3103/S0027132214030061zbMath1337.94110MaRDI QIDQ2018031

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)

Related Items (2)

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

Cites Work

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

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