wyszukanych pozycji: 6
![]() |
Algorithms and Complexity
ISBN: 9780367659486 / Angielski / Miękka / 2020 / 219 str. Termin realizacji zamówienia: ok. 16-18 dni roboczych. |
cena:
228,88 zł |
![]() |
Algorithms and Complexity
ISBN: 9781568811789 / Angielski / Twarda / 2002 / 232 str. Termin realizacji zamówienia: ok. 16-18 dni roboczych. 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 with the network flow problem are fundamental in many areas of graph connectivity, matching theory, etc. Algorithms in number theory are discussed with some applications to public key encryption. This second edition will differ from the present edition mainly in that solutions to most of the...
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 ...
|
cena:
396,75 zł |
![]() |
Generatingfunctionology: Third Edition
ISBN: 9781568812793 / Angielski / Twarda / 2005 / 256 str. Termin realizacji zamówienia: ok. 16-18 dni roboczych. 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 Chains - Number Theory One of the most important and relevant recent applications of combinatorics lies in the development of Internet search engines whose incredible capabilities dazzle even the mathematically trained user.
Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis....
|
cena:
269,58 zł |
![]() |
A = B
ISBN: 9780367448714 / Angielski / Miękka / 2019 / 224 str. Termin realizacji zamówienia: ok. 16-18 dni roboczych. 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 applications in other areas of mathematics. From the table of contents: * Proof Machines * Tightening the Target * The Hypergeometric Database * The Five Basic Algorithms: Sister Celine's Method, Gosper&'s Algorithm, Zeilberger's Algorithm, The WZ Phenomenon, Algorithm Hyper * Epilogue: An Operator...
This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method ...
|
cena:
300,10 zł |
![]() |
Finite Sections of Some Classical Inequalities
ISBN: 9783642867149 / Angielski / Miękka / 2012 / 84 str. Termin realizacji zamówienia: ok. 20 dni roboczych. 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 family of operators on /p. When such inequalities are restricted only to finitely many variables, we can then ask for the rate at which the bounds of the restrictions approach the uniform bound. In the context of Toeplitz forms, such research was initiated over fifty years ago by Szego 37J, and the chain...
Hardy, Littlewood and P6lya's famous monograph on inequalities 17J has served as an introduction to hard analysis for many mathema ticians. Some of i...
|
cena:
191,85 zł |
![]() |
A = B
ISBN: 9781568810638 / Angielski / Twarda / 1996 / 224 str. Termin realizacji zamówienia: ok. 16-18 dni roboczych. 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 applications in other areas of mathematics.
From the table of contents: * Proof Machines * Tightening the Target * The Hypergeometric Database * The Five Basic Algorithms: Sister Celine's Method, Gosper&'s Algorithm, Zeilberger's Algorithm, The WZ Phenomenon, Algorithm Hyper * Epilogue: An Operator... This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method ...
|
cena:
890,27 zł |