Hash Function Simple Checker Matrix Multiplication Algorithm Containment Problem Fast Matrix Multiplication 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. L. Babai, L. Fortnow, L.A. Levin, M. Szegedy, “Checking Computations in Polylogarithmic Time,” Univ. of Chicago Tech. Rept. 91–08 (March 1991) and in Proc. 23rd ACM STOC 91Google Scholar
  2. L. Babai, L. Fortnow, and C. Lund, “Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols,” Univ. of Chicago Tech. Rept. 91–10, 39 pp (April 1991). To appear in “Computational Complexity,” Vol 1, No 1 (1991).Google Scholar
  3. M. Blum, M. Luby, and R. Rubinfeld, “Self-Testing/Correcting with Applications to Numerical Problems,” STOC 90 (May 1990), 73–83.Google Scholar
  4. M. Blum and S. Kannan, “Designing Programs that Check their Work”, 21st Annual Symposium on Theory of Computing (May 1989), pp. 86–97.Google Scholar
  5. J.L. Carter and M.N. Wegman, “New Hash Functions and Their Use in Authentication and Set Equality,” J. of Comp. and Syst. Science, Vol 22, No 3, pp 265–279 (1981).CrossRefGoogle Scholar
  6. R.J. Lipton, “New Directions in Testing,” Computer Science Dept Tech. Report, Princeton University (1989).Google Scholar
  7. R. Kannan (Personal Communication)Google Scholar
  8. J. Schwartz, “Fast Probabilistic Algorithms for Verification of Polynomial Identities,” J. ACM, Vol 27, No 4, pp 701–717 (October 1980).CrossRefGoogle Scholar
  9. A. Shamir, “IP = PSPACE,” Proc. 31st IEEE FOCS 90, pp. 11–15(October 1990).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Manuel Blum
    • 1
  1. 1.CS Division, EECS DepartmentUniversity of California at BerkeleyBerkeley

Personalised recommendations