Related links
Some combinatorics related sites::
Links to some lectures notes in computational
complexity can be
found at ECCC
.
Below are more links:
On-line books, surveys and lecture
notes
(unsorted
list):
- Introduction
to Probability , a book by Charles M. Grinstead and
J. Laurie Snell
- The
Complexity of Boolean Functions, an online version of the
book by Ingo Wegener printed in 1987
- Introduction
to Finite Mathematics , a book by John G. Kemeny, J.
Laurie
Snell, and Gerald L. Thompson
- Probability
and
Graph Theory
in Computer Science, lecture notes by Manuel Blum
- Randomized
Algorithms, lecture notes by David Karger
- Randomized
Algorithms, lecture notes by Leonard Schulman
- Graph
Theory, a book by Reinhard Diestel (electronic edition)
- Graph
Theory, lecture notes by Tero Harju
- Iteractive
Proof Systems, lecture notes by Jaikumar Radhakrishnan
and
Sanjeev Saluja
- Combinatorial
Complexity Theory, lecture notes by Gudmund S. Frandsen
- Combinatorics
for Computer Scientists, lecture notes by Dany Breslauer
and Devdatt P. Dubhashi (BRICS Lecture Series LS-95-4)
- Unsolved
Combinatorial Problems, lecture notes by Zsoltan Tuza
(BRICS
Lecture Series LS-01-1)
- Ramsey
Theory Applications,
a survey by Vera Rosta (Electronic Journal of
Combinatorics, DS13, Dec. 2004)
Last modified: February 4, 2004
Return to the
home page of the book