Skip to main content
SpringerLink
Log in

Gems in the Field of Bounded Queries

  • Chapter
Computability and Models

Part of the book series: The University Series in Mathematics ((USMA))

  • 418 Accesses

Abstract

Let A be a set. Given {x 1,…,x n }, I may want to know (1) which elements of {x 1,…,x n }, are in A, (2) how many elements of {x 1,…,x n } are in A, or (3) is |{x 1,…,x n }∩A| even. All of these can be determined with n queries to A. For which A, n can we get by with fewer queries? Other questions involving ‘how many queries do you need to…’ have been posed and (some) answered. This article is a survey of the gems in the field—the results that both answer an interesting question and have a nice proof.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beigel, Richard (1987). Query-Limited Reducibilities. PhD thesis, Stanford University. Also available as Report No. STAN-CS-88–1221.

    Google Scholar 

  2. Beigel, Richard (1988). When are k + 1 queries better than k? Technical Report 88-06, The Johns Hopkins University, Dept. of Computer Science.

    Google Scholar 

  3. Beigel, Richard, Gasarch, William, Gill, John, and Owings, James (1993). Terse, superterse, and verbose sets. Information and Computation, 103(1):68–85.

    Article  MathSciNet  MATH  Google Scholar 

  4. Beigel, Richard, Gasarch, William, Kummer, Martin, Martin, Georgia, McNicholl, Timothy, and Stephan, Frank (2000). The complexity of ODDn a;?. Journal of Symbolic Logic, pages 1–18.

    Google Scholar 

  5. Beigel, Richard, Gasarch, William, Kummer, Martin, Martin, Georgia, McNicholl, Timothy, and Stephan, Frank (1996). On the query complexity of sets. In 21st International Symposium on Mathematical Foundations of Computer Science (MFCS ′96), Cracow, Poland.

    Google Scholar 

  6. Blumer, A., Ehrenfeucht, A., Haussler, D., and Warmuth, M. (1989). Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36:929–965.

    Article  MathSciNet  MATH  Google Scholar 

  7. Cai, Jin-yi and Hemachandra, Lane A. (1989). Enumerative counting is hard. Information and Computation. Earlier version in Structures 1988.

    Google Scholar 

  8. Clarke, Steven, Owings, Jim, and Spriggs, James (1975). Trees with full subtrees. In Proc. of the 6th Southeastern Conference on Combinatorics, Graph Theory, and Computing, pages 169–172.

    Google Scholar 

  9. Dekker, J. C. E. (1954). A theorem on hypersimple sets. Proceedings of the AMS, 5:791–796.

    Article  MathSciNet  MATH  Google Scholar 

  10. Gasarch, William (1985). A hierarchy of functions with applications to recursive graph theory. Technical Report 1651, University of Maryland, Dept. of Computer Science.

    Google Scholar 

  11. Gasarch, William and Martin, Georgia (1999). Bounded Queries in Recursion Theory. Progress in Computer Science and Applied Logic. Birkhäuser, Boston.

    Book  MATH  Google Scholar 

  12. Haussler, D. and Welzl, E. (1987). ∈-nets and simplex range queries. Discrete Computational Geometry, 2:127–151.

    Article  MathSciNet  MATH  Google Scholar 

  13. Hemaspaandra, Hempel, and Wechsung (1998). Query order, sicomp, 28.

    Google Scholar 

  14. Jockusch, Carl (1968). Semirecursive sets and positive reducibility. Transactions of the AMS, 131:420–436.

    Article  MathSciNet  Google Scholar 

  15. Jockusch, Carl (1989). Degrees of functions with no fixed points. In Fenstad, J.E., Frolov, I., and Hilpinen, R., editors, Logic, Methodology, and Philosophy of Science VIII, pages 191–201. North Holland.

    Google Scholar 

  16. Jockusch, Carl and Soare, Robert (1972). Π1 0 classes and degrees of theories. Transactions of the AMS, 173:33–56.

    MathSciNet  MATH  Google Scholar 

  17. Kummer, Martin (1992). A proof of Beigel’s cardinality conjecture. Journal of Symbolic Logic, 57(2):677–681.

    Article  MathSciNet  MATH  Google Scholar 

  18. Kummer, Martin and Stephan, Frank (1994). Effective search problems. Mathematical Logic Quarterly, 40:224–236.

    Article  MathSciNet  MATH  Google Scholar 

  19. McNichol, Tim (2000). On the commutativity of jumps. Journal of Symbolic Logic, 65(4).

    Google Scholar 

  20. Miller, Webb and Martin, Donald A. (1968). The degree of hyperimmune sets. Zeitsch.f. math. Logik und Grundlagen d. Math., 14:159–166.

    Article  MathSciNet  MATH  Google Scholar 

  21. Odifreddi, Piergiorgio (1989). Classical Recursion Theory (Volume 1). North-Holland, Amsterdam.

    MATH  Google Scholar 

  22. Owings, Jr., James C. (1989). A cardinality version of Beigel’s Nonspeedup Theorem. Journal of Symbolic Logic, 54(3):761–767.

    Article  MathSciNet  MATH  Google Scholar 

  23. Sauer, N. (1972). On the density of families of sets. Journal of Combinatorial Theory (series A), 13:145–147.

    Article  MathSciNet  MATH  Google Scholar 

  24. Scott, Dana (1962). Algebras of sets binumerable in complete extension of arithmetic. In Proceedings Symposium Pure and Applied Mathematics 5, pages 117–121.

    Google Scholar 

  25. Shelah, S. (1972). A combinatorial problem: stability and order for models and theories of infinitary languages. Pacific Journal of Mathematics, 41:247–261.

    Article  MathSciNet  MATH  Google Scholar 

  26. Soare, Robert (1987). Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic. Springer-Verlag, Berlin.

    Google Scholar 

  27. Soare, Robert (1996). Computability and recursion. Bulletin of Symbolic Logic, 27.

    Google Scholar 

  28. Vapnik, V. N. and Chervonenkis, A. Y. (1971). On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probab. and its Applications, 16(2): 264–280.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Maryland at College Park, 20742, MD, USA

    William Gasarch

Authors
  1. William Gasarch
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer Science+Business Media New York

About this chapter

Cite this chapter

Gasarch, W. (2003). Gems in the Field of Bounded Queries. In: Computability and Models. The University Series in Mathematics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0755-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-0755-0_7

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5225-9

  • Online ISBN: 978-1-4615-0755-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation