Combinatorics for computer science
- Pages
- 479
- 2 editions
- First published
- 1985
- 1 language
Join or log in to shelve and rate Free, no password.
Overview
This beginning graduate level text studies the use of geometric and algebraic structures to compare and classify combinatorial algorithms. The geometric concepts, in particular, are useful in both complexity analysis and practical programming. This book is on the creative commons (Google Books). Further discussion can be found at the website of the Department of Computer Science and Engineering, UCSD: http://cseweb.ucsd.edu/~gill/AlgCombSite/
Ratings & reviews
Log in to rate or review this book.
No written reviews yet.
Discussions
Talk about this book with other readers.
Log in to start a discussion.
No discussions yet.
Editions
Details & links
- First published
- 1985
- Pages
- 479
- Languages
- Available in 1 language
Where to buy this book: see “Buy this book”
More about this book
Read a sample, borrow it or see other editions → openlibrary.org