ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Probability, algorithms and complexity
Full text PdfPdf (225 KB)
Source Symposium on Discrete Algorithms archive
Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms table of contents
New York, New York
Pages 565-565  
Year of Publication: 2009
Author
Volker Strassen  University of Konstanz, Germany
Publisher
Society for Industrial and Applied Mathematics  Philadelphia, PA, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 104,   Citation Count: 0
Additional Information:

abstract   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

The talk will be a little sightseeing tour through some areas of mathematics and theoretical computer science that I found and find fascinating

The tour may touch on the development of a gamblers fortune, the multiplication of numbers and of matrices, probabilistic tests of primality and the complexity of continued fractions.


INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.0 General

Additional Classification:
  G. Mathematics of Computing
  G.3 PROBABILITY AND STATISTICS


General Terms:
Theory

Collaborative Colleagues:
Volker Strassen: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player