Combinatorics Topics, Techniques, Algorithms
- Textbook
Description
Combinatorics is a subject of increasing importance, owing to its links with computer science, statistics and algebra. This is a textbook aimed at second-year undergraduates to beginning graduates. It stresses common techniques (such as generating functions and recursive construction) which underlie the great variety of subject matter and also stresses the fact that a constructive or algorithmic proof is more valuable than an existence proof. The book is divided into two parts, the second at a higher level and with…
- Add bookmark
- Cite
- Share
Key features
- Written in two parts at different levels
- Includes projects for brighter students
- Features historical notes which add perspective
- Incorporates numerous exercises
About the book
- DOI https://doi.org/10.1017/CBO9780511803888
- Subjects Algorithms, Complexity, and Theory of Computing,Computer Science,Discrete Mathematics Information Theory and Coding,Mathematics
- Format: Paperback
- Publication date: 27 January 1995
- ISBN: 9780521457613
- Dimensions (mm): 247 x 174 mm
- Weight: 0.649kg
- Page extent: 368 pages
- Availability: Available
- Format: Digital
- Publication date: 28 May 2018
- ISBN: 9780511803888
Access options
Review the options below to login to check your access.
Personal login
Log in with your Cambridge Higher Education account to check access.
Purchase options
There are no purchase options available for this title.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.