An edition of Combinatorics for computer science
(1985)
Combinatorics for computer science
by S. Gill Williamson
Share
×Close
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/
Check nearby libraries
Buy this book
| Edition | Availability |
|---|---|
1
|
zzzz
|
2
|
aaaa
|
Book Details
Edition Notes
Bibliography: p. 450-472.
Includes index.
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
Lists
See All
History
- Created April 1, 2008
- 12 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| March 28, 2025 | Edited by ImportBot | Redacting ocaids |
| December 11, 2022 | Edited by MARC Bot | import existing book |
| May 26, 2022 | Edited by ImportBot | import existing book |
| October 30, 2020 | Edited by MARC Bot | import existing book |
| April 1, 2008 | Created by an anonymous user | Imported from Scriblio MARC record |