Open Access Senior Thesis
Bachelor of Science
© 2010 Richard Strong Bowen
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.
Bowen, Richard Strong, "Minimal Circuits for Very Incompletely Specified Boolean Functions" (2010). HMC Senior Theses. 18.