Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR02-067 | 5th October 2002 00:00

k-Approximating Circuits

RSS-Feed




TR02-067
Authors: Marco Cadoli, Francesco Donini, Paolo Liberatore, Marco Schaerf
Publication: 10th December 2002 19:39
Downloads: 1327
Keywords: 


Abstract:

In this paper we study the problem of approximating a boolean
function using the Hamming distance as the approximation measure.
Namely, given a boolean function f, its k-approximation is the
function f^k returning true on the same points in which f does,
plus all points whose Hamming distance from the previous set
is at most k. We investigate whether k-approximation generates
an exponential increase in size or not, when functions are
represented as circuits. We also briefly investigate the increase
in the size of the circuit for other forms of approximation.



ISSN 1433-8092 | Imprint