Frequency Computation and Bounded Queries

Authors

Richard Beigel, University of Maryland at College Park
William I. Gasarch
Efim Kinber, Sacred Heart UniversityFollow

Document Type

Article

Publication Date

8-30-1996

Abstract

There have been several papers over the last ten years that consider the number of queries needed to compute a function as a measure of its complexity. The following function has been studied extensively in that light: Ft(xl,. . .,x0) = ,4(x,). .A(x,). We are interested in the complexity (in terms of the number of queries) of approximating Fi. Let b