Formal verification of change making algorithms

Nadeem Abdul Hamid, Brook Bowers · 2013

We present progress on a project to formally verify properties of various algorithms related to the change making problem. In particular, we formalize proofs of the classic greedy algorithm's behavior as well as an algorithm to verify its optimality for particular coin systems.

Read the paper · More papers on PaperTik