Proof of lower estimates for the complexity of self-correcting circuits by the method of basis changing

DOI10.3103/S0027132210030034zbMath1304.94137MaRDI QIDQ2513137

Nikolay P. Red'kin

Publication date: 2 February 2015

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

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12) Boolean functions (94D10) Networks and circuits as models of computation; circuit complexity (68Q06)

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Proof of lower estimates for the complexity of self-correcting circuits by the method of basis changing