The Art of Computer Programming: Seminumerical algorithms
- ISBN-10
- 0201038226
- ISBN-13
- 9780201038224
- Series
- The Art of Computer Programming
- Category
- Mathematics / Algebra / General
- Pages
- 688
- Language
- English
- Published
- 1981
- Publisher
- Addison-Wesley Publishing Company
- Author
- Donald Ervin Knuth
Description
V.1 - Fundamentals algorithms: Basic concepts. Algorithms. Mathematical preliminaries. MIX. Some fundamental programming techniques. Information structures. Linear lists. Trees. Multilinked structures. Dynamic storage allocation. History and bibliography. Random numbers. Generating uniform random numbers. Statistical tests. Other types of random quantities. What is a random sequence? Summary. Arithmetic. Positional number systems. Floating-point arithmetic. Multiple-precision arithmetic. Radix conversion. Rational arithmetic. Polynomial arithmetic. Manipulation of power series. v. 2. Seminumerical algorithms. Random numbers. Arithmetic.
Get the book
Other editions
-
- 1973
- 723 pages
- Paperback
- Addison-Wesley Publishing Company
-
- 1968
- 624 pages
- Paperback
- Addison-Wesley Publishing Company
-
- 2009-03-24
- - pages
- Paperback
- Addison-Wesley Professional
Similar books
-
The Art of Computer Programming
By Donald Ervin KnuthNetworks of workstations, 267, 390. Neumann, John von (= Margittai Neumann János), 8, 159, 385. Newcomb, Simon, 42, 45. Newell, Allen, 729. Newman, Donald Joseph, 505. Nielsen, Jakob, 511–512. Nievergelt, Jürg, 476, 480, 549, 564.
-
The Art of Computer Programming: Volume 3: Sorting and Searching
By Donald E. KnuthNetworks of workstations, 267, 390. Neumann, John von (= Margittai Neumann János), 8, 159, 385. Newcomb, Simon, 42, 45. Newell, Allen, 729. Newman, Donald Joseph, 505. Nielsen, Jakob, 511–512. Nievergelt, Jürg, 476, 480, 549, 564.
-
Art of Computer Programming, Volume 2: Seminumerical Algorithms
By Donald E. KnuthParticularly noteworthy in this third edition is Knuth's new treatment of random number generators, and his discussion of calculations with formal power series.
-
The Art of Computer Programming, Volume 4B: Combinatorial Algorithms
By Donald E. KnuthWith the addition of this new volume, it continues to be the definitive description of classical computer science. Volume 4B, the sequel to Volume 4A, extends Knuth's exploration of combinatorial algorithms.
-
Generating All Trees: History of Combinatorial Generation
By Donald Ervin KnuthGenerating All Trees: History of Combinatorial Generation
-
An Introduction to the Analysis of Algorithms: Introdu Analysi Algori_p2
By Philippe Flajolet, Robert SedgewickI am sure that every serious computer scientist will find this book rewarding in many ways." —From the Foreword by Donald E. Knuth
-
The Art of Computer Programming, Volume 1, Fascicle 1: MMIX -- A RISC Computer for the New Millennium
By Donald E. KnuthThe Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e ISBN: 0321751043 Art of Computer Programming, Volume 1, Fascicle 1, The: MMIX -- A RISC Computer for the New Millennium This multivolume work on the analysis of algorithms has ...
-
The MMIX Supplement: Supplement to The Art of Computer Programming Volumes 1, 2, 3 by Donald E. Knuth
By Martin RuckertThe MMIX Supplement: Supplement to The Art of Computer Programming Volumes 1, 2, 3 by Donald E. Knuth “I encourage serious programmers everywhere to sharpen their skills by devouring this book.” –Donald E. Knuth In the first edition ...
-
The Art of Computer Programming, Volume 4A: Combinatorial Algorithms
By Donald E. KnuthWith this rule Guo and Hall proved that the 3 × 3 automaton will preserve the connectivity structure of the image, in a strong sense that we will discuss below. Furthermore their algorithm obviously leaves an image intact if it is ...
-
The Art of UNIX Programming
By Eric S. Raymond... pearsontechgroup.com For sales outside of the U.S., please contact: International Sales (317) 581-3793 ... please submit a written request to: Pearson Education, Inc., Rights and Contracts Department, 75 Arlington Street, Suite 300, ...