On Realizations of Boolean Functions Requiring a Minimal or Near-Minimal Number of Tests

DOI10.1109/T-C.1971.223163zbMath0254.94037OpenAlexW2140737090MaRDI QIDQ5668381

John P. Hayes

Publication date: 1971

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/t-c.1971.223163

Mathematics Subject Classification ID

Related Items (2)

Self-checking circuits and decoding algorithms for binary hamming and BCH codes and Reed-Solomon codes over GF(2 m ) ⋮ Computations over finite monoids and their test complexity

This page was built for publication: On Realizations of Boolean Functions Requiring a Minimal or Near-Minimal Number of Tests