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

DOI10.1007/BF01386084MaRDI QIDQ2393964zbMATH OpenOpenAlexFDO

Authors 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

Cites work

• A Linear Diophantine Problem
• Gaps in the exponent set of primitive matrices
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3176160 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• Note on Linear Forms
• On a Diophantine Problem
• Remark on a Recent Note on Linear Forms
• The index of primitivity of a non-negative matrix

Cited in

(6)

• On a linear diophantine problem of Frobenius: an improved algorithm
• Über Partitionen und ein lineares diophantisches Problem
• Ergodic properties of populations. I: The one sex model
• Formulae for the Frobenius number in three variables
• scientific article; zbMATH DE number 7310235 (Why is no real title available?)
• Computational complexity of the original and extended Diophantine Frobenius problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2393964)