Herbert S. Wilf – författare
Visar alla böcker från författaren Herbert S. Wilf. Handla med fri frakt och snabb leverans.
15 produkter
Generating Functionology
E-bok, 2013
807 kr
Lägg i varukorg
This is the Second Edition of the highly successful introduction to the use of generating functions and series in combinatorial mathematics. This new edition includes several new areas of application, including the cycle index of the symmetric group, permutations and square roots, counting …
= B
Av Marko Petkovsek, Herbert S Wilf m. fl.
Häftad, 2019
1017 kr
Lägg i varukorg
This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifully written, the book contains practical applications as well as conceptual developments that will have …
Algorithms and Complexity
Häftad, 2020
761 kr
Lägg i varukorg
This book is an introductory textbook on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for algorithm analysis. Recursive algorithms are illustrated by Quicksort, FFT, fast matrix multiplications, and others. Algorithms associated …
Combinatorial Algorithms
An Update
Häftad, 1989
584 kr
Lägg i varukorg
This monograph is a survey of some of the work that has been done since the appearance of the second edition of Combinatorial Algorithms. Topics include progress in: Gray Codes, listing of subsets of given size of a given universe, listing rooted and free trees, selecting free trees and unlabeled …
= B
Av Doron Zeilberger, Herbert S Wilf m. fl.
E-bok, 1996
1169 kr
Lägg i varukorg
This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifully written, the book contains practical applications as well as conceptual developments that will have …
generatingfunctionology
Third Edition
E-bok, 2005
1056 kr
Lägg i varukorg
Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in - Combinatorics - Probability Theory - Statistics - Theory of Markov …
generatingfunctionology
Third Edition
E-bok, 2005
1056 kr
Lägg i varukorg
Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in - Combinatorics - Probability Theory - Statistics - Theory of Markov …
= B
Av Doron Zeilberger, Herbert S Wilf m. fl.
E-bok, 1996
1169 kr
Lägg i varukorg
This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifully written, the book contains practical applications as well as conceptual developments that will have …
Combinatorial Algorithms
For Computers and Calculators
Av Herbert S. Wilf, Albert Nijenhuis m. fl.
E-bok, 2014
807 kr
Lägg i varukorg
Combinatorial Algorithms for Computers and Calculators, Second Edition deals with combinatorial algorithms for computers and calculators. Topics covered range from combinatorial families such as the random subset and k-subset of an n-set and Young tableaux, to combinatorial structures including the …
Generatingfunctionology
E-bok, 2014
356 kr
Lägg i varukorg
Generatingfunctionology provides information pertinent to generating functions and some of their uses in discrete mathematics. This book presents the power of the method by giving a number of examples of problems that can be profitably thought about from the point of view of generating functions. …
= B
Av Marko Petkovsek, Herbert S Wilf m. fl.
Inbunden, 1996
3864 kr
Lägg i varukorg
This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifully written, the book contains practical applications as well as conceptual developments that will have …
Algorithms and Complexity
Inbunden, 2002
1530 kr
Lägg i varukorg
This book is an introductory textbook on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for algorithm analysis. Recursive algorithms are illustrated by Quicksort, FFT, fast matrix multiplications, and others. Algorithms associated …
generatingfunctionology
Third Edition
Inbunden, 2005
1002 kr
Lägg i varukorg
Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in - Combinatorics - Probability Theory - Statistics - Theory of Markov …
Finite Sections of Some Classical Inequalities
E-bok, 2012
734 kr
Lägg i varukorg
Hardy, Littlewood and P6lya''s famous monograph on inequalities [17J has served as an introduction to hard analysis for many mathema ticians. Some of its most interesting results center around Hilbert''s inequality and generalizations. This family of inequalities determines the best bound of a …
Finite Sections of Some Classical Inequalities
Häftad, 2012
551 kr
Lägg i varukorg
Hardy, Littlewood and P6lya's famous monograph on inequalities [17J has served as an introduction to hard analysis for many mathema ticians. Some of its most interesting results center around Hilbert's inequality and generalizations. This family of inequalities determines the best bound of a …
