The Community for Technology Leaders
Green Image
ABSTRACT
In this paper, we define and study the k-approximating circuits. A circuit accepting a given set of inputs A is k-approximated by accepting inputs that differ from one of A by at most k bits. We show that the existence of polynomial-size k-approximating circuits depends on the relation between k and the number of inputs.
INDEX TERMS
Reliability and testing, complexity measures and classes, models of computation.
CITATION
Paolo Liberatore, Marco Schaerf, Francesco M. Donini, Marco Cadoli, "k-Approximating Circuits", IEEE Transactions on Computers, vol. 55, no. , pp. 913-917, July 2006, doi:10.1109/TC.2006.105
113 ms
(Ver 3.1 (10032016))