Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition). Knuth, D. E. Addison-Wesley Professional, 3 edition, November, 1997. ![Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition) [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex Volume 2 of Donald Knuth's 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 that's suitable for college or graduate-level computer science courses or individual study by programmers. Volume 2 is an indispensable part of any working programmer's library.
@book{KnuthVol2,
abstract = {Volume 2 of Donald Knuth's 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 that's suitable for
college or graduate-level computer science courses or individual study by
programmers. Volume 2 is an indispensable part of any working programmer's
library.},
added-at = {2018-12-02T16:09:07.000+0100},
author = {Knuth, Donald E.},
biburl = {https://www.bibsonomy.org/bibtex/22452eb83b874cb1e7e559f2b1e9719b9/karthikraman},
citeulike-article-id = {175026},
citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&path=ASIN/0201896842},
citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\&path=ASIN/0201896842},
citeulike-linkout-10 = {http://www.worldcat.org/oclc/833203460},
citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21\&path=ASIN/0201896842},
citeulike-linkout-3 = {http://www.amazon.jp/exec/obidos/ASIN/0201896842},
citeulike-linkout-4 = {http://www.amazon.co.uk/exec/obidos/ASIN/0201896842/citeulike00-21},
citeulike-linkout-5 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0201896842},
citeulike-linkout-6 = {http://www.worldcat.org/isbn/0201896842},
citeulike-linkout-7 = {http://books.google.com/books?vid=ISBN0201896842},
citeulike-linkout-8 = {http://www.amazon.com/gp/search?keywords=0201896842\&index=books\&linkCode=qs},
citeulike-linkout-9 = {http://www.librarything.com/isbn/0201896842},
day = 14,
edition = 3,
howpublished = {Hardcover},
interhash = {d965d5f8b85eba44e86414261e6a2bca},
intrahash = {2452eb83b874cb1e7e559f2b1e9719b9},
isbn = {0201896842},
keywords = {library kr},
month = nov,
posted-at = {2012-02-06 11:16:25},
priority = {2},
publisher = {Addison-Wesley Professional},
timestamp = {2018-12-02T16:09:07.000+0100},
title = {Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition)},
url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0201896842},
year = 1997
}
Downloads: 0
{"_id":"NLZuWmiAKhsLpcggw","bibbaseid":"knuth-artofcomputerprogrammingvolume2seminumericalalgorithms3rdedition-1997","authorIDs":[],"author_short":["Knuth, D. E."],"bibdata":{"bibtype":"book","type":"book","abstract":"Volume 2 of Donald Knuth's 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 that's suitable for college or graduate-level computer science courses or individual study by programmers. Volume 2 is an indispensable part of any working programmer's library.","added-at":"2018-12-02T16:09:07.000+0100","author":[{"propositions":[],"lastnames":["Knuth"],"firstnames":["Donald","E."],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/22452eb83b874cb1e7e559f2b1e9719b9/karthikraman","citeulike-article-id":"175026","citeulike-linkout-0":"http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20&path=ASIN/0201896842","citeulike-linkout-1":"http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21&path=ASIN/0201896842","citeulike-linkout-10":"http://www.worldcat.org/oclc/833203460","citeulike-linkout-2":"http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21&path=ASIN/0201896842","citeulike-linkout-3":"http://www.amazon.jp/exec/obidos/ASIN/0201896842","citeulike-linkout-4":"http://www.amazon.co.uk/exec/obidos/ASIN/0201896842/citeulike00-21","citeulike-linkout-5":"http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20&path=ASIN/0201896842","citeulike-linkout-6":"http://www.worldcat.org/isbn/0201896842","citeulike-linkout-7":"http://books.google.com/books?vid=ISBN0201896842","citeulike-linkout-8":"http://www.amazon.com/gp/search?keywords=0201896842&index=books&linkCode=qs","citeulike-linkout-9":"http://www.librarything.com/isbn/0201896842","day":"14","edition":"3","howpublished":"Hardcover","interhash":"d965d5f8b85eba44e86414261e6a2bca","intrahash":"2452eb83b874cb1e7e559f2b1e9719b9","isbn":"0201896842","keywords":"library kr","month":"November","posted-at":"2012-02-06 11:16:25","priority":"2","publisher":"Addison-Wesley Professional","timestamp":"2018-12-02T16:09:07.000+0100","title":"Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition)","url":"http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20&path=ASIN/0201896842","year":"1997","bibtex":"@book{KnuthVol2,\n abstract = {Volume 2 of Donald Knuth's classic series {\\_The} Art of Computer Programming\\_\ncovers seminumerical algorithms, with topics ranging from random number\ngenerators to floating point operations and other optimized arithmetic\nalgorithms. Truly comprehensive and meticulously written, this book (and\nseries) is that rarest of all creatures--a work of authoritative scholarship\nin classical computer science, but one that can be read and used profitably by\nvirtually all working programmers.\n\nThe book begins with fundamental questions regarding random numbers and how to\nuse algorithms to generate them. Subsequent chapters demonstrate efficient\ncomputation of single-precision and double-precision arithmetic calculations\nand modular arithmetic. The text then presents prime factorization (which can\nbe used in cryptography, for instance) and algorithms for calculating\nfractions. This volume ends with algorithms for polynomial arithmetic and\nmanipulation of power-series topics, which will benefit those with some\nknowledge of calculus.\n\nThroughout this beautifully presented edition, Knuth incorporates hundreds of\nuseful exercises for trying out the algorithms. These range from simple\nproblems to larger research project topics. (The book provides answers, where\nappropriate, at the end of the book.) The result is a text that's suitable for\ncollege or graduate-level computer science courses or individual study by\nprogrammers. Volume 2 is an indispensable part of any working programmer's\nlibrary.},\n added-at = {2018-12-02T16:09:07.000+0100},\n author = {Knuth, Donald E.},\n biburl = {https://www.bibsonomy.org/bibtex/22452eb83b874cb1e7e559f2b1e9719b9/karthikraman},\n citeulike-article-id = {175026},\n citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\\&path=ASIN/0201896842},\n citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\\&path=ASIN/0201896842},\n citeulike-linkout-10 = {http://www.worldcat.org/oclc/833203460},\n citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21\\&path=ASIN/0201896842},\n citeulike-linkout-3 = {http://www.amazon.jp/exec/obidos/ASIN/0201896842},\n citeulike-linkout-4 = {http://www.amazon.co.uk/exec/obidos/ASIN/0201896842/citeulike00-21},\n citeulike-linkout-5 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\\&path=ASIN/0201896842},\n citeulike-linkout-6 = {http://www.worldcat.org/isbn/0201896842},\n citeulike-linkout-7 = {http://books.google.com/books?vid=ISBN0201896842},\n citeulike-linkout-8 = {http://www.amazon.com/gp/search?keywords=0201896842\\&index=books\\&linkCode=qs},\n citeulike-linkout-9 = {http://www.librarything.com/isbn/0201896842},\n day = 14,\n edition = 3,\n howpublished = {Hardcover},\n interhash = {d965d5f8b85eba44e86414261e6a2bca},\n intrahash = {2452eb83b874cb1e7e559f2b1e9719b9},\n isbn = {0201896842},\n keywords = {library kr},\n month = nov,\n posted-at = {2012-02-06 11:16:25},\n priority = {2},\n publisher = {Addison-Wesley Professional},\n timestamp = {2018-12-02T16:09:07.000+0100},\n title = {Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition)},\n url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\\&path=ASIN/0201896842},\n year = 1997\n}\n\n","author_short":["Knuth, D. E."],"key":"KnuthVol2","id":"KnuthVol2","bibbaseid":"knuth-artofcomputerprogrammingvolume2seminumericalalgorithms3rdedition-1997","role":"author","urls":{"Paper":"http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20&path=ASIN/0201896842"},"keyword":["library kr"],"downloads":0},"bibtype":"book","biburl":"http://www.bibsonomy.org/bib/author/knuth?items=1000","creationDate":"2020-09-02T04:23:16.331Z","downloads":0,"keywords":["library kr"],"search_terms":["art","computer","programming","volume","seminumerical","algorithms","3rd","edition","knuth"],"title":"Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition)","year":1997,"dataSources":["itEMDWSsMF4yAjQgP"]}