skip to main content
10.1145/130069.130111acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article
Free access

A note on checking matrix products (extended abstract)

Published: 01 March 1992 Publication History
First page of PDF

References

[1]
Adleman, L., M. Huang and K. Kompella, "Efficiently checkers for number-theoretic computations", (unpublished manuscript)
[2]
Aho, A., J. ttopcroft and J. Ullman, The Design and Analysis of Computer Algorithms", Addison-Wesley, Inc., Reading, MA (1973).
[3]
Atallah, M and R. Kosaraju, "An adversary based lower bound for sorting", Information Processing Letters, 13-2, (1981), pp. 55-57.
[4]
Bini, D., G. Lotti and F. Romani, "Approximate solutions for the bilinear form computational problem", SlAM Journal on Computing, Vol. 9, No. 4, (1980), pp. 692-697.
[5]
Blum, M and S. Kannan, "Designing programs that check their work", Proc. of ~1st Annual ACM Syrup. on Theory of Computing, (1989), pp. 86-97.
[6]
Blum, M., M. Luby and R. Rubinfeld, "Self-testing/ Correcting with applications to numerical problems", "Proc. of 2~nd Annual A CM Syrup. on Theory of Computing, (1990).
[7]
Borodin, A. and I. Munro, "The Computational Complexity of Algebraic and Numerical Problems", Elsevier Computer Science Library, New York (1975).
[8]
Chung, M. and B. Ravikumar, "Bounds on the size of test sets for sorting and related networks", Discrete Mathematics 81 (1990), pp. 1-9.
[9]
Coppersmith and S. Winograd, "Matrix multiplication via arithmetic progressions", Proc. of 19th Annual ACM Syrup. on Theory of Computing, (1987), pp. 1-6.
[10]
Freivalds, R., "Fast probabilistic algorithms", Proc. of Mathematical Foundations of Computer Science, Springer-VeHag Lecture Notes in Computer Science, (1979), pp. 57-69.
[11]
Goldwasser, S., S. Micali and C. Rackoff, "The knowledge complexity of interactive proof systems", Proc. of 17th Annual A CM Syrup. on Theory of Computing, (1985) l)p. 291-304.
[12]
Itopcroft, J. and L. Kerr, "On minimizing the number of multiplications necessary for matrix multiplication", SIAM Journal on Applied Mathematics 20, (1971), pp. 30-36.
[13]
Hu. T.C. and M.T. Shing, "Some theorems about matrix multiplications", Proc. of 21st Annual IEEE Symposium on Foundations of Computer Science, (1aS0), pp. 2S-35.
[14]
Lipton, R., "New directions in testing", Proc. of DI- MACS Workshop on Distribuled Computing and C~ptograph~t, (1989).

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SAC '92: Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
March 1992
1296 pages
ISBN:089791502X
DOI:10.1145/130069
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1992

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

SAC92
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25
The 40th ACM/SIGAPP Symposium on Applied Computing
March 31 - April 4, 2025
Catania , Italy

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 185
    Total Downloads
  • Downloads (Last 12 months)8
  • Downloads (Last 6 weeks)7
Reflects downloads up to 26 Jan 2025

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media