Combinatorics for computer science
by S. Gill Williamson
- 0 Ratings
- 0 Want to read
- 0 Currently reading
- 0 Have read
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
Previews available in: English
Showing 2 featured editions. View all 2 editions?
| Edition | Availability |
|---|---|
1
|
aaaa
Libraries near you:
WorldCat
|
2
|
zzzz
Libraries near you:
WorldCat
|
Book Details
Edition Notes
Includes bibliographical references (p. 450-472) and index.
Originally published: Rockville, Md. : Computer Science Press, c1985.
Classifications
External Links
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?
History
- Created April 1, 2008
- 10 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| May 4, 2023 | Edited by ImportBot | import existing book |
| June 17, 2022 | Edited by ImportBot | import existing book |
| December 5, 2020 | Edited by MARC Bot | import existing book |
| March 20, 2019 | Edited by ImportBot | import existing book |
| April 1, 2008 | Created by an anonymous user | Imported from Scriblio MARC record |