Title :
k-approximating circuits
Author :
Cadoli, Marco ; Donini, Francesco M. ; Liberatore, Paolo ; Schaerf, Marco
Author_Institution :
Dipt. di Inf. e Sistemistica, Rome Univ., Italy
fDate :
7/1/2006 12:00:00 AM
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 lifter 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.
Keywords :
Boolean functions; computational complexity; directed graphs; Boolean space; Hamming distance; directed graph; polynomial-size k-approximating circuits; Approximation methods; Boolean functions; Circuit testing; Computational modeling; Computer applications; Databases; Extraterrestrial measurements; Hamming distance; Pattern matching; Polynomials; Reliability and testing; complexity measures and classes; models of computation.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.2006.105
