Bøger i Dover Books on Computer Science serien

This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. More than 200 exercises, many with complete solutions. 1991 edition.

This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition.

Explores Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Assumes some familiarity with calculus. Original 2005 edition.

Engineers and scientists who want to avoid errors in their computer-assisted calculations will welcome this concise guide. In addition to its practical advice on detecting and removing the bugs that plague finite-precision calculations, it also outlines techniques for preserving significant figures, avoiding extraneous solutions, and finding efficient iterative processes for solving nonlinear equations. 1996 edition.