Frequency Computation and Bounded Queries


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 <a and… (More)
DOI: 10.1109/SCT.1995.514852


1 Figure or Table