The Art of Computer Programming: Seminumerical algorithmsV.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. Floatingpoint arithmetic. Multipleprecision arithmetic. Radix conversion. Rational arithmetic. Polynomial arithmetic. Manipulation of power series. v. 2. Seminumerical algorithms. Random numbers. Arithmetic. 
From inside the book
1 page matching "essentially equal" "approximately equal" "definitely less than" in this book
Where's the rest of this book?
Results 11 of 1
What people are saying  Write a review
User ratings
5 stars 
 
4 stars 
 
3 stars 
 
2 stars 
 
1 star 

Review: Art of Computer Programming, The, Volumes 13 Boxed Set (Art of Computer Programming)
User Review  Kully  GoodreadsOk, so there are very few people who have 'read' this. But I've had this for years and still reach for it for reference and just browsing. Read full review
Review: Art of Computer Programming, The, Volumes 13 Boxed Set (Art of Computer Programming)
User Review  Frank  GoodreadsExquisitely dense and almost impossibly difficult to the point of unintelligibility for most humans, including people with a degree in CS. Read full review
Contents
Chapter 3Random Numbers  1 
Chapter 4Arithmetic  178 
Answers to Exercises  516 
Copyright  
2 other sections not shown
Other editions  View all
Common terms and phrases
addition chain approximately assume balanced ternary binary bits calculation chisquare coefficients consider continued fraction decimal defined definition deg(u digits discussed distribution divide division elements equal equation Euclid's algorithm evaluate example exercise exponent fact floating point numbers formula function given greatest common divisor hence Horner's rule input integers irreducible irreducible polynomials Lemma linear congruential linear congruential sequence Math matrix method modulo multiplication multisets nonnegative nonzero normal notation number system obtained occurs oodistributed operations output overflow period length polynomial of degree positive integers possible prime factors primitive polynomial probability problem procedure proof prove quantity radix radix point random number rational numbers real numbers relatively prime representation result satisfy Section solution spectral test step subroutine subtraction tensor Theorem transformation unique factorization domain variables vectors zero