scientific article; zbMATH DE number 1285548

MaRDI QIDQ4242301zbMATH OpenFDO

Authors Nikolay P. Red'kin

Publication date 10 May 1999

zbMATH Keywords

complexitylower boundBoolean functioncircuitinaccuracyformula

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Fault detection; testing in circuits and networks (94C12)

Recommendations

• scientific article; zbMATH DE number 942481
• Complexity of self-correcting circuits for some sequence of Boolean functions
• scientific article; zbMATH DE number 850403
• scientific article; zbMATH DE number 1285549
• scientific article; zbMATH DE number 4187722

Cited in

(7)

• Complexity of self-correcting circuits for some sequence of Boolean functions
• The minimal circuits for linear Boolean functions
• scientific article; zbMATH DE number 942481 (Why is no real title available?)
• Minimum Universal Logic Module Sequential Circuits with Decoders
• Minimal contact circuits for a sequence of Boolean functions
• Inversion complexity of self-correcting circuits for a certain sequence of Boolean functions
• Asymptotically minimal schemes for one sequence of Boolean functions

This page was built for publication:

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