E-bok, Engelska, 2016
Combinatorial Methods with Computer Applications
Del i serien Discrete Mathematics and Its Applications
2304 kr
Läs direkt i Bokus Reader – eller ladda ned till din enhet (PDF kräver ofta zoom och scroll på små skärmar).
Fler format och utgåvor
Beskrivning
This combinatorics text provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. It presents the computer and software algorithms in pseudo-code and incorporates definitions, theorems, proofs, examples, and nearly 300 illustrations as pedagogical elements of the exposition. Numerous problems, solutions, and hints reinforce basic skills and assist with creative problem solving. The author also offers a website with extensive graph theory informational resources as well as a computational engine to help with calculations for some of the exercises.
Produktinformation
- Utgivningsdatum: 2016-04-19
- Språk: Engelska
- Filformat: PDF
- Kopieringsskydd: LCP
- ISBN: 9781584887447
- Förlag: Taylor & Francis Ltd
- Serie: Discrete Mathematics and Its Applications
Utforska kategorier
Recensioner i media
... The book is very carefully written and might be a good starting point for undergraduate students. ... -Zentralblatt MATH 1168 I recently got [this] book on combinatorics and applications to computer science, and I like it so much that I am trying to re-shape some of the discrete maths courses I teach so that I could use it. I liked particularly [the] section on asymptotics, which is much more accessible for my undergrads than Graham, Knuth, and Patashnik. -Josef Lauri, University of Malta
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.