Skip to main content

A Brief Introduction to Property Testing

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6650))

Abstract

This short article provides a brief description of the main issues that underly the study of property testing.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   79.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   99.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Fischer, E., Newman, I., Shapira, A.: A Combinatorial Characterization of the Testable Graph Properties: It’s All About Regularity. In: 38th STOC, pp. 251–260 (2006)

    Google Scholar 

  2. Batu, T., Fortnow, L., Rubinfeld, R., Smith, W.D., White, P.: Testing that Distributions are Close. In: 41st FOCS, pp. 259–269 (2000)

    Google Scholar 

  3. Blum, M., Luby, M., Rubinfeld, R.: Self-Testing/Correcting with Applications to Numerical Problems. JCSS 47(3), 549–595 (1990); Extended abstract in 22nd STOC (1990)

    MathSciNet  MATH  Google Scholar 

  4. Goldreich, O. (ed.): Property Testing. LNCS, vol. 6390, pp. 142–157. Springer, Heidelberg (2010)

    Book  Google Scholar 

  5. Goldreich, O.: Introduction to Testing Graph Properties. In: Goldreich, O., et al.: Studies in Complexity and Cryptography. LNCS, vol. 6650, pp. 467–471. Springer, Heidelberg (2011)

    Google Scholar 

  6. Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM, 653–750 (July 1998); Extended abstract in 37th FOCS (1996)

    Google Scholar 

  7. Goldreich, O., Ron, D.: Property Testing in Bounded Degree Graphs. Algorithmica 32(2), 302–343 (2002); Extended abstract in 29th STOC (1997)

    Article  MathSciNet  MATH  Google Scholar 

  8. Goldreich, O., Ron, D.: A Sublinear Bipartitness Tester for Bounded Degree Graphs. Combinatorica 19(3), 335–373 (1999); Extended abstract in 30th STOC (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kaufman, T., Krivelevich, M., Ron, D.: Tight bounds for testing bipartiteness in general graphs. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. RANDOM, pp. 341–353. Springer, Heidelberg (2003)

    Google Scholar 

  10. Parnas, M., Ron, D., Rubinfeld, R.: Tolerant Property Testing and Distance Approximation. JCSS 72(6), 1012–1042 (2006); Preliminary version in ECCC (2004)

    MathSciNet  MATH  Google Scholar 

  11. Ron, D.: Property Testing: A Learning Theory Perspective. Foundations and Trends in Machine Learning 1(3), 307–402 (2008)

    Article  MATH  Google Scholar 

  12. Ron, D.: Algorithmic and Analysis Techniques in Property Testing. Foundations and Trends in TCS 5(2), 73–205 (2010)

    MathSciNet  MATH  Google Scholar 

  13. Rubinfeld, R., Sudan, M.: Robust Characterization of Polynomials with Applications to Program Testing. SIAM Journal on Computing 25(2), 252–271 (1996)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Goldreich, O. (2011). A Brief Introduction to Property Testing. In: Goldreich, O. (eds) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. Lecture Notes in Computer Science, vol 6650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22670-0_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22670-0_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22669-4

  • Online ISBN: 978-3-642-22670-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics