Combinatorial Methods with Computer Applications
- ISBN-10
- 1584887443
- ISBN-13
- 9781584887447
- Category
- Computers
- Pages
- 664
- Language
- English
- Published
- 2016-04-19
- Publisher
- CRC Press
- Author
- Jonathan L. Gross
Description
Combinatorial Methods with Computer Applications 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. Requiring only a foundation in discrete mathematics, it can serve as the textbook in a combinat
Get the book
Other editions
Similar books
-
How to Count: An Introduction to Combinatorics and Its Applications
By Robert A. BeelerProviding a self-contained resource for upper undergraduate courses in combinatorics, this text emphasizes computation, problem solving, and proof technique.
-
Advances in Combinatorial Methods and Applications to Probability and Statistics
By N. BalakrishnanAn urn model and the coalescent in neutral infinitealleles genetic process, In Selected Proceedings of the Sheffield Symposium on Applied Probability (Eds., I.V. Basawa and R. Taylor), pp. 174-192, Hayward, CA: Institute of Mathematical ...
-
Extremal Combinatorics: With Applications in Computer Science
By Stasys JuknaThis is a concise, up-to-date introduction to extremal combinatorics for non-specialists.
-
Advances in Combinatorial Methods and Applications to Probability and Statistics
By N. BalakrishnanAdvances in Combinatorial Methods and Applications to Probability and Statistics
-
Extremal Combinatorics: With Applications in Computer Science
By Stasys JuknaThis book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists.
-
Introduction to Combinatorial Testing
By D. Richard Kuhn, Yu Lei, Raghu N. KackerIntroduction to Combinatorial Testing presents a complete self-contained tutorial on advanced combinatorial testing methods for re
-
Foundations of Combinatorics with Applications
By Edward A. Bender, S. Gill WilliamsonSuitable for upper-level undergraduates and graduate students in engineering, science, and mathematics, this introductory text explores counting and listing, graphs, induction and recursion, and generating functions.
-
Combinatorial Optimization: Algorithms and Complexity
By Kenneth Steiglitz, Christos H. PapadimitriouThis graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP ...
-
Combinatorics for Computer Science
By Stanley Gill WilliamsonMost recently , a number of helpful ideas were contributed by my students Sue O. Hart , Paul Kaschube , and Mark Mummy . Sue Hart , in particular , read the entire manuscript and found and corrected numerous errors .
-
Combinatorial Methods in Discrete Mathematics
By Vladimir Nikolaevitch Sachkov, Vladimir N. SachkovThis is an attempt to present some complex problems of discrete mathematics in a simple and unified form using a unique, general combinatorial scheme.