Algorithmic Mathematics

Stefan Hougardy is professor of discrete mathematics at the University of Bonn. His research interests include combinatorial optimization and chip design.Jens Vygen is professor of discrete mathematics at the University of Bonn. His research interests include combinatorial optimization and chip design.

• 1 Introduction.- 2 Representations of the Integers.- 3 Computing with Integers.- 4 Approximate Representations of the Real Numbers.- 5 Computing with Errors.- 6 Graphs.- 7 Simple Graph Algorithms.- 8 Sorting Algorithms.- 9 Optimal Trees and Paths.- 10 Matchings and Network Flows.- 11 Gaussian Elimination.- Bibliography.- Index

"The book under review contains the lectures the authors have taught at the University of Bonn for beginner students. It includes many worked-out examples, detailed explanations, as well as references for further study. ... Alongside the mathematical themes, the authors have included an introduction to the programming language C++." (Costica Morosanu, zbMATH 1357.68002, 2017) "This is a brief introduction to some simple numerical and computer algorithms, including an analysis of their timing. It's aimed at students with a good high-school math background, but has no specific prerequisites, and has enough material for a one-semester course. ... a good choice for a very early introduction to these topics." (Allen Stenger, MAA Reviews, maa.org, December, 2016)