A fast and simple algorithm for the money changing problem
From MaRDI portal
Publication:995775
DOI10.1007/s00453-007-0162-8zbMath1129.11059OpenAlexW2081147536MaRDI QIDQ995775
Sebastian Böcker, Zsuzsanna Lipták
Publication date: 10 September 2007
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-0162-8
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computer solution of Diophantine equations (11Y50) Linear Diophantine equations (11D04)
Related Items (14)
Enumerating Possible Molecular Formulae in Mass Spectrometry Using a Generating Function Based Method ⋮ On the Sound Covering Cycle Problem in Paired de Bruijn Graphs ⋮ Unnamed Item ⋮ Determination of Glycan Structure from Tandem Mass Spectra ⋮ Inferring Peptide Composition from Molecular Formulas ⋮ Unnamed Item ⋮ On the hulls of cyclic codes of oddly even length over \(\mathbb{Z}_4\) ⋮ On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems ⋮ Counting glycans revisited ⋮ On approximate jumbled pattern matching in strings ⋮ Hulls of cyclic and negacyclic codes over finite fields ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
This page was built for publication: A fast and simple algorithm for the money changing problem
