Mathcom Home
Services Customers Tech Info Contact Us
 

Discrete algorithms

 A good intro text for discrete algorithms is: Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms MIT Press.

Also see: DIMACS: the Center for Discrete Mathematics and Theoretical Computer Science Discrete algorithms include:

  • Sorting algorithms
  • Network traversal (traveling salesman, etc)
  • Primality testing (see the cryptography FAQs mentioned above).
  • Automata Theory
  • Many other fields


    Copyright 1995-2008 Mathcom Solutions Inc       info@mathcom.com       Updated March 27, 2008