skip to main content
research-article

Approximate Query Complexity

Published:01 August 2011Publication History
Skip Abstract Section

Abstract

Let f : {0, 1}n → {0, 1}. Let μ be a product probability measure on {0, 1}n. For ϵ ≥ 0, we define (f), the ϵ-approximate decision tree complexity of f, to be the minimum depth of a decision tree T with μ(T(x) ≠ f(x)) ≤ ϵ. For j = 0 or 1 and for δ ≥ 0, we define Cj,δ(f), the δ-approximate j-certificate complexity of f, to be the minimum certificate complexity of a set AΩ with μ(AΔf−1(j)) ≤ ϵ. Note that if μ(x) > 0 for all x then D0(f) = D(f) and Cj,0(f) = Cj(f) are the ordinary decision tree and j-certificate complexities of f, respectively. We extend the well-known result, D(f) ≤ C1(f)C0(f) [Blum and Impagliazzo 1987; Hartmanis and Hemachandra 1991; Tardos 1989], proving that for all ϵ > 0 there exists a δ > 0 and a constant K = K(ϵ, δ) > 0 such that for all n, μ, f, (f) ≤ K C1,δ(f)C0,δ (f). We also give a partial answer to a related question on query complexity raised by Tardos [1989]. We prove generalizations of these results to general product probability spaces.

References

  1. Aho, A. V., Ullman, J. D., and Yannakakis, M. 1983. On notions of information transfer in vlsi circuits. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing (STOC’83). ACM, New York, 133--139. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Berg, J. v. d. and Kesten, H. 1985. Inequalities with applications to percolation and reliability. J. Appl. Probab. 22, 3, 556--569.Google ScholarGoogle ScholarCross RefCross Ref
  3. Blum, M. and Impagliazzo, R. 1987. Generic oracles and oracle classes. In Proceedings of the Annual IEEE Symposium on Foundations of Computer Science. 118--126. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Goldstein, L. and Rinott, Y. 2007. Functional BKR inequalities, and their duals, with applications. J. Theoret. Probab. 20, 2, 275--293.Google ScholarGoogle ScholarCross RefCross Ref
  5. Halstenberg, B. and Reischuk, R. 1988. On different modes of communication. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC’88). ACM, New York, 162--172. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Hartmanis, J. and Hemachandra, L. A. 1991. One-Way functions and the nonisomorphism of NP-complete sets. Theoret. Comput. Sci. 81, 1, (Part A), 155--163. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Impagliazzo, R. and Rudich, S. 2000. Personal communication.Google ScholarGoogle Scholar
  8. Kahn, J., Saks, M., and Smyth, C. 2000. A dual version of Reimer’s inequality and a proof of Rudich’s conjecture. In Proceedings of the 15th Annual IEEE Conference on Computational Complexity. IEEE Computer Society, Los Alamitos, CA, 98--103. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Kushilevitz, E. and Nisan, N. 1997. Communication Complexity. Cambridge University Press, Cambridge, UK. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Reimer, D. 2000. Proof of the van den Berg-Kesten conjecture. Combin. Probab. Comput. 9, 1, 27--32. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Smyth, C. 2002. Reimer’s inequality and Tardos’ conjecture. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing. ACM, New York, 218--221. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Tardos, G. 1989. Query complexity, or why is it difficult to separate NPA ∩ co-NPA from PA by random oracles A? Combinatorica 9, 4, 385--392.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Approximate Query Complexity

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Article Metrics

        • Downloads (Last 12 months)4
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!