期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2002
卷号：2002
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：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.
