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

DOI10.3103/S0027132212030102zbMath1296.94178MaRDI QIDQ355279

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)

Related Items (1)

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

Cites Work

• Asymptotically minimal schemes for one sequence of Boolean functions
• Unnamed Item

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