337,194 ventas concretadas desde abril 2017.
011-3221-3652 
+54-911-2290-6553
-Titulo Original : Art Of Computer Programming, Volume 2: Seminumerical Algorithms
-Fabricante :
Addison-Wesley Professional
-Descripcion Original:
The bible of all fundamental algorithms and the work that taught many of todays software developers most of what they know about computer programming. -Byte, September 1995 I cant begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasnt in the line-up. -Charles Long If you think youre a really good programmer... read [Knuths] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing. -Bill Gates Its always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. -Jonathan Laventhol The second volume offers a complete introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. The book summarizes the major paradigms and basic theory of such algorithms, thereby providing a comprehensive interface between computer programming and numerical analysis. Particularly noteworthy in this third edition is Knuths new treatment of random number generators, and his discussion of calculations with formal power series. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP), Review Volume 2 of Donald Knuths classic series The Art of Computer Programming covers seminumerical algorithms, with topics ranging from random number generators to floating point operations and other optimized arithmetic algorithms. Truly comprehensive and meticulously written, this book (and series) is that rarest of all creatures--a work of authoritative scholarship in classical computer science, but one that can be read and used profitably by virtually all working programmers. The book begins with fundamental questions regarding random numbers and how to use algorithms to generate them. Subsequent chapters demonstrate efficient computation of single-precision and double-precision arithmetic calculations and modular arithmetic. The text then presents prime factorization (which can be used in cryptography, for instance) and algorithms for calculating fractions. This volume ends with algorithms for polynomial arithmetic and manipulation of power-series topics, which will benefit those with some knowledge of calculus. Throughout this beautifully presented edition, Knuth incorporates hundreds of useful exercises for trying out the algorithms. These range from simple problems to larger research project topics. (The book provides answers, where appropriate, at the end of the book.) The result is a text thats suitable for college or graduate-level computer science courses or individual study by programmers. Volume 2 is an indispensable part of any working programmers library. From the Back Cover The bible of all fundamental algorithms and the work that taught many of todays software developers most of what they know about computer programming. Byte, September 1995 I cant begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasnt in the line-up. Charles Long If you think youre a really good programmer... read [Knuths] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing. Bill Gates Its always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. Jonathan Laventhol The second volume offers a complete introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. The book summarizes the major paradigms and basic theory of such algorithms, thereby providin
-Fabricante :
Addison-Wesley Professional
-Descripcion Original:
The bible of all fundamental algorithms and the work that taught many of todays software developers most of what they know about computer programming. -Byte, September 1995 I cant begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasnt in the line-up. -Charles Long If you think youre a really good programmer... read [Knuths] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing. -Bill Gates Its always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. -Jonathan Laventhol The second volume offers a complete introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. The book summarizes the major paradigms and basic theory of such algorithms, thereby providing a comprehensive interface between computer programming and numerical analysis. Particularly noteworthy in this third edition is Knuths new treatment of random number generators, and his discussion of calculations with formal power series. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP), Review Volume 2 of Donald Knuths classic series The Art of Computer Programming covers seminumerical algorithms, with topics ranging from random number generators to floating point operations and other optimized arithmetic algorithms. Truly comprehensive and meticulously written, this book (and series) is that rarest of all creatures--a work of authoritative scholarship in classical computer science, but one that can be read and used profitably by virtually all working programmers. The book begins with fundamental questions regarding random numbers and how to use algorithms to generate them. Subsequent chapters demonstrate efficient computation of single-precision and double-precision arithmetic calculations and modular arithmetic. The text then presents prime factorization (which can be used in cryptography, for instance) and algorithms for calculating fractions. This volume ends with algorithms for polynomial arithmetic and manipulation of power-series topics, which will benefit those with some knowledge of calculus. Throughout this beautifully presented edition, Knuth incorporates hundreds of useful exercises for trying out the algorithms. These range from simple problems to larger research project topics. (The book provides answers, where appropriate, at the end of the book.) The result is a text thats suitable for college or graduate-level computer science courses or individual study by programmers. Volume 2 is an indispensable part of any working programmers library. From the Back Cover The bible of all fundamental algorithms and the work that taught many of todays software developers most of what they know about computer programming. Byte, September 1995 I cant begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasnt in the line-up. Charles Long If you think youre a really good programmer... read [Knuths] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing. Bill Gates Its always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. Jonathan Laventhol The second volume offers a complete introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. The book summarizes the major paradigms and basic theory of such algorithms, thereby providin
Contáctenos
- el bazar digital.com SRL
- 011 - 3221-3652
- info@elbazardigital.com
- +54 9 11 2290-6553
