Combinatorics (Fall 2010)/Course materials: Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
imported>WikiSysop
Created page with '* ''J. H. van Lint and R. M. Wilson,'' A course in Combinatorics, 2nd Edition, Cambridge University Press, 2001. * ''P. J. Cameron,'' Combinatorics: Topics, Techniques, Algorithm…'
 
imported>WikiSysop
No edit summary
Line 1: Line 1:
* ''J. H. van Lint and R. M. Wilson,'' A course in Combinatorics, 2nd Edition, Cambridge University Press, 2001.
* ''J. H. van Lint and R. M. Wilson,'' A course in Combinatorics, 2nd Edition, Cambridge University Press, 2001.
* ''P. J. Cameron,'' Combinatorics: Topics, Techniques, Algorithms, Cambridge University Press, 1995.
* ''P. J. Cameron,'' Combinatorics: Topics, Techniques, Algorithms, Cambridge University Press, 1995.
* ''R. L. Graham, D. E. Knuth, and O. Patashnik,'' Concrete Mathematics: A Foundation for Computer Science, 2nd Edition, Addison-Wesley, 1994.
* ''R. L. Graham, D. E. Knuth, and O. Patashnik,'' Concrete Mathematics: A Foundation for Computer Science, 2nd Edition, Addison-Wesley, 1994.

Revision as of 07:01, 1 July 2010

  • J. H. van Lint and R. M. Wilson, A course in Combinatorics, 2nd Edition, Cambridge University Press, 2001.
  • P. J. Cameron, Combinatorics: Topics, Techniques, Algorithms, Cambridge University Press, 1995.
  • R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, 2nd Edition, Addison-Wesley, 1994.
  • R. Stanley, Enumerative Combinatorics, Volume 1, 2nd Edition, Cambridge University Press, 2000.
  • N. Alon and J. H. Spencer, The Probabilistic Method, 3rd Edition, Wiley, 2008.
  • C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Dover Publications, 1998.