 | | Home : Math : Higher Mathematics : Discrete Mathematics : Rosen, Discrete Mathematics and Its Applications, 6th Edition : Chapter 03 : Page 2 | | LINKS: |  | |
Pages: [<<] 1 2 3 4 [>>] | - Page 195 - Section 3.3
5.2.1.3 The bubble sort algorithm -- A description and analysis of the bubble sort and insertion sort algorithms can be found by exploring here.
http://www.scism.sbu.ac.uk/law/Section5/chap2/s5c2p13.html
(Added: Fri Jul 28 2006)
- Page 195 - Section 3.3
Lecture 11 -- You can find information on the computational complexity for different kinds of sorts here in this lecture written by Victor J. Milenkovic at the University of Miami for a course on data structures and algorithms.
http://www.cs.miami.edu/~vjm/csc517/11.txt
(Added: Fri Jul 28 2006)
- Page 197 - Section 3.3
Lecture Notes on Algorithm Analysis and Complexity Theory -- Ian Parberry of University of North Texas provides useful useful material on many topics in discrete mathematics with these lecture notes. You will need a PDF viewer to read these notes.
http://www.eng.unt.edu/ian/books/free/lnoa.pdf
(Added: Fri Jul 28 2006)
- Page 197 - Section 3.3
A compendium of NP optimization problems -- Information about approximate algorithms for NP optimization problems can be found here.
http://www.nada.kth.se/~viggo/problemlist/compendium.html
(Added: Fri Jul 28 2006)
- Page 197 - Section 3.3
NP-Completeness -- Examples of several NP-Complete problems can be found in the lecture notes for ICS 161: Design and Analysis of Algorithms.
http://www1.ics.uci.edu/~eppstein/161/960312.html
(Added: Fri Jul 28 2006)
- Page 197 - Section 3.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 204 - Section 3.4
Johann Carl Friedrich Gauss -- Biographical information and a portrait of Karl Friedrich Gauss can be found at the MacTutor History of Mathematics Archive site, at the University of St. Andrews, Scotland.
http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Gauss.html
(Added: Fri Jul 28 2006)
- Page 205 - Section 3.4
What is a hash function? -- You can find another explanation of a hash function on the RSA Security website here.
http://www.rsasecurity.com/rsalabs/node.asp?id=2176
(Added: Fri Jul 28 2006)
- Page 205 - Section 3.4
Whatis.com hashing -- You can find more on hashing functions here.
http://whatis.techtarget.com/definition/0,289893,sid9_gci212230,00.html
(Added: Fri Jul 28 2006)
- Page 206 - Section 3.4
Pseudorandom Number Generator -- To learn more about pseudorandom number generators, consult the Wikipedia article here.
http://en.wikipedia.org/wiki/Pseudorandom_number_generator
(Added: Fri Jul 28 2006)
- Page 206 - Section 3.4
Pseudorandom Numbers -- You can learn more about pseudorandom numbers at this PlanetMath page.
http://planetmath.org/encyclopedia/PseudorandomNumbers.html
(Added: Fri Jul 28 2006)
- Page 206 - Section 3.4
pLab, Theory and Practice of Random Number Generation -- A good starting place to learn more about random numbers is this server.
http://random.mat.sbg.ac.at/links/
(Added: Fri Jul 28 2006)
- Page 208 - Section 3.4
SSH - Tech Corner - Introduction to Cryptography -- An informative introduction to cryptography can be found at the SSH - Tech Corner website.
http://www.ssh.fi/tech/crypto/intro.html
(Added: Fri Jul 28 2006)
- Page 208 - Section 3.4
Introduction to Cryptography -- Information about cryptography can be found at this site.
http://www.cs.hut.fi/ssh/crypto/intro.html
(Added: Fri Jul 28 2006)
- Page 208 - Section 3.4
A-Z Cryptology -- Information about cryptography can be found at this page provided by SSH Communications Security.
http://www.ssh.com/support/cryptography/index.html
(Added: Fri Jul 28 2006)
- Page 212 - Section 3.5
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 212 - Section 3.5
Prime Factorization Applet -- You can find the prime factorization of positive integers using an applet found at the m@th IT site.
http://www.math-it.de/Mathematik/Zahlentheorie/Zahl/ZahlApplet.html
(Added: Fri Jul 28 2006)
- Page 212 - Section 3.5
The Prime Pages -- The Prime Pages, written by Chris Caldwell of the University of Tennessee, Martin, include a rich collection of information about prime numbers. Among the things you can find on the Prime Pages are various lists of primes, such as the first 100,008 primes, and useful programs for factoring numbers and finding primes.
http://www.utm.edu/research/primes/
(Added: Fri Jul 28 2006)
- Page 213 - Section 3.5
Marin Mersenne -- Biographical information and a portrait of Mersenne can be found at the MacTutor History of Mathematics Archive site, at the University of St. Andrews, Scotland.
http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Mersenne.html
(Added: Fri Jul 28 2006)
- Page 213 - Section 3.5
The Great Internet Mersenne Prime Search -- A wealth of resources about Mersenne primes is available at the Great Internet Mersenne Prime Search (GIMPS) site, including the current status of the search for new ones, and the latest discoveries and press releases. You can join the Great Internet Mersenne Prime Search yourself; download the necessary software from this site and you can sign up and reserve a range of numbers to check.
http://www.mersenne.org/
(Added: Fri Jul 28 2006)
- Page 213 - Section 3.5
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 213 - Section 3.5
The Cunningham Project -- You can obtain information about the Cunningham Project, including the ten most wanted integers, here.
http://homes.cerias.purdue.edu/~ssw/cun/index.html
(Added: Sat Jul 08 2006)
- Page 214 - Section 3.5
Conjectures and Open Questions -- The latest information about Goldbach's conjecture, the infinitude of primes of the form x˛ + 1, and the twin prime conjecture can be found here.
http://www.utm.edu/research/primes/notes/conjectures/
(Added: Fri Jul 28 2006)
- Page 214 - Section 3.5
Goldbach Conjecture Verification -- Go to the website of Tomás Oliveira e Silva for the latest information about the verification of Golbach's conjecture for successively larger even integers. Also check out a related computation covering the number of Goldbach partitions of even numbers.
http://www.ieeta.pt/~tos/goldbach.html
(Added: Fri Jul 28 2006)
- Page 215 - Section 3.5
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)
| |
Pages: [<<] 1 2 3 4 [>>] | |
