 | | Home : Math : Higher Mathematics : Discrete Mathematics : Rosen, Discrete Mathematics and Its Applications, 6th Edition : Chapter 07 : Page 2 | | LINKS: |  | |
Pages: [<<] 1 2 | - Page 474 - Section 7.3
Divide-and-conquer. A fundamental idea. -- The fundamental idea of divide-and-conquer algorithms is described here.
http://algo.inria.fr/dumas/DC/fond_am.html
(Added: Fri Jul 28 2006)
- Page 474 - Section 7.3
Algorithm Design Paradigms -- Paul E. Dunne of the Department of Computer Science at the University of Liverpool, England, has written an excellent introduction to divide-and-conquer algorithms, including discussions of the binary search, multiplication of integers, and finding the closest pair of points in the plane. This site can be found here.
http://www.csc.liv.ac.uk/~ped/teachadmin/algor/d_and_c.html
(Added: Fri Jul 28 2006)
- Page 474 - Section 7.3
Complexity of Algorithms -- Information about the complexity of algorithms, including analysis of best/average/worst case running times, and the complexity of divide-and-conquer algorithms can be found here.
http://facstaff.pepperdine.edu/lrogers/ma220/ch11/11-4.htm
(Added: Fri Jul 28 2006)
- Page 475 - Section 7.3
Algorithm Design Paradigms -- Paul E. Dunne of the Department of Computer Science at the University of Liverpool, England, has written an excellent introduction to divide-and-conquer algorithms, including discussions of the binary search, multiplication of integers, and finding the closest pair of points in the plane. This site can be found here.
http://www.csc.liv.ac.uk/~ped/teachadmin/algor/d_and_c.html
(Added: Fri Jul 28 2006)
- Page 476 - Section 7.3
Fast Matrix Multiplication -- You can learn more about fast matrix multiplication using the Strassen algorithm here on Wikipedia.
http://en.wikipedia.org/wiki/Strassen_algorithm
(Added: Fri Jul 28 2006)
- Page 479 - Section 7.3
Algorithm Design Paradigms -- Paul E. Dunne of the Department of Computer Science at the University of Liverpool, England, has written an excellent introduction to divide-and-conquer algorithms, including discussions of the binary search, multiplication of integers, and finding the closest pair of points in the plane. This site can be found here.
http://www.csc.liv.ac.uk/~ped/teachadmin/algor/d_and_c.html
(Added: Fri Jul 28 2006)
- Page 483 - Section 7.3 Exercise #28
Ulam's Problem - Project #5 -- A description of Ulam's problem about guessing a number with one lie allowed can be found here.
http://www.cs.mcgill.ca/~psavad/cs251/ulam.html
(Added: Fri Jul 28 2006)
- Page 484 - Section 7.4
Generating Functions -- To learn more about generating functions, consult this Wikipedia article.
http://en.wikipedia.org/wiki/Generating_function
(Added: Fri Jul 28 2006)
- Page 499 - Section 7.4 Exercises
Probability-generating function -- To learn more about probability generating functions consult the Wikipedia article here.
http://en.wikipedia.org/wiki/Probability-generating_function
(Added: Fri Jul 28 2006)
- Page 507 - Section 7.6
Notes and Literature on Prime Numbers -- Information about prime numbers, together with interactive applets for exploring prime numbers, can be found on pages provided by Peter Alfeld at the University of Utah. These pages also include applets for running the sieve of Eratosthenes and for exploring the distribution of prime numbers. Information about twin primes and the Goldbach conjecture is also provided.
http://www.math.utah.edu/~alfeld/math/prime.html
(Added: Fri Jul 28 2006)
- Page 508 - Section 7.6
Eratosthenes of Cyrene -- Biographical information about Eratosthenes and a demonstration and applet of the sieve of Eratosthenes can be found here.
http://www.math.utah.edu/~alfeld/Eratosthenes.html
(Added: Fri Jul 28 2006)
- Page 508 - Section 7.6
Eratosthenes -- Biographical information and a portrait of Eratosthenes can be found on the MacTutor History of Mathematics Archive at the University of St. Andrews, Scotland
http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Eratosthenes.html
(Added: Fri Jul 28 2006)
- Page 510 - Section 7.6
Combinatorial Object Server -- You can generate many different types of combinatorial objects, including combinations, permutations, set partitions, spanning trees, permutations, and derangements at the Combinatorial Object Server here.
http://www.theory.cs.uvic.ca/~cos/gen/perm.html
(Added: Fri Jul 28 2006)
- Page 510 - Section 7.6
Derangement -- from MathWorld -- More information about derangements can be found at the MathWorld website here.
http://mathworld.wolfram.com/Derangement.html
(Added: Fri Jul 28 2006)
- Page 510 - Section 7.6
Derangement Diagrams -- An interesting way to look at derangements graphically can be found at Robert M. Dichau's Mathematical Figures site.
http://mathforum.org/advanced/robertd/derangements.html
(Added: Fri Jul 28 2006)
- Page 511 - Section 7.6
Rencontres number -- Consult the Wikipedia article here to learn more about rencontres numbers.
http://en.wikipedia.org/wiki/Rencontres_number
(Added: Fri Jul 28 2006)
| |
Pages: [<<] 1 2 | |
