A graph-theoretic algorithm for the solution of a linear diophantine problem of Frobenius

DOI10.1007/BF01386084zbMath0125.29802OpenAlexW2024710936MaRDI QIDQ2393964

B. R. Heap, M. S. Lynn

Publication date: 1964

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131621

zbMATH Keywords

number theory

Related Items (6)

Formulae for the Frobenius number in three variables ⋮ On a linear diophantine problem of Frobenius: an improved algorithm ⋮ Computational complexity of the original and extended diophantine Frobenius problem ⋮ Über Partitionen und ein lineares diophantisches Problem ⋮ Ergodic properties of populations. I: The one sex model ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gaps in the exponent set of primitive matrices
• The index of primitivity of a non-negative matrix
• Note on Linear Forms
• On a Diophantine Problem
• Remark on a Recent Note on Linear Forms
• A Linear Diophantine Problem

This page was built for publication: A graph-theoretic algorithm for the solution of a linear diophantine problem of Frobenius