About this book

Random numbers and arithmetic, with some of the most beautiful analysis in computing.

AI × CS

AlphaEvolve multiplies 4×4 complex matrices with 48 multiplications, beating Strassen

Fast matrix multiplication, which this book covers: one better than Strassen's 1969 method.

born 1938 · American computer scientist and mathematician

Profession: Mathematician, Computer scientist, Professor
Worked at: Caltech, Stanford, Burroughs Corporation, Institute for Defense Analyses
Studied at: Caltech, Case Western Reserve University
Studied under: Marshall Hall
Prizes: Turing Award (1974), National Medal of Science (1979), Kyoto Prize (1996), Guggenheim Fellowship (1972), Leroy P. Steele Prize (1986), Franklin Medal (1988), Harvey Prize (1995), BBVA Foundation Frontiers of Knowledge Award (2010), Faraday Medal (2011), Foreign Member of the Royal Society (2003), Fellow of the American Mathematical Society (2013), Grace Murray Hopper Award (1971), Paul R. Halmos - Lester R. Ford Awards (1975), Josiah Willard Gibbs Lectureship (1978), Fellow of the British Computer Society (1980), W. Wallace McDowell Award (1980), ACM Software System Award (1986), ACM Fellow (1994), IEEE John von Neumann Medal (1995), Computer History Museum Fellow (1998), Fellow of the Society for Industrial and Applied Mathematics (2009), Turing Talk (2011), John von Neumann Prize (2016)

Sends a $2.56 cheque to anyone who finds an error in his books.

Prerequisite: The Art of Computer Programming, Volume 1 (Knuth)

Yes · Addison-Wesley, 3rd edition

Get the 3rd edition (1997); later printings add corrections.

First editions and signed copies open a search on AbeBooks, cheapest first. We may earn a commission if you buy through these links.

7 editions

First published 1969

Earliest edition listed: 1969 · Addsion Weslsey Longman Publishing Group

The list may be incomplete, especially for older and non-English editions.