Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
Minimal Circuits For Very Incompletely Specified Boolean Functions, Richard Strong Bowen
Minimal Circuits For Very Incompletely Specified Boolean Functions, Richard Strong Bowen
HMC Senior Theses
In this report, asymptotic upper and lower bounds are given for the minimum number of gates required to compute a function which is only partially specified and for which we allow a certain amount of error. The upper and lower bounds match. Hence, the behavior of these minimum circuit sizes is completely (asymptotically) determined.