On a linear diophantine problem of Frobenius: an improved algorithm

DOI10.1007/BF01436078MaRDI QIDQ2395342zbMATH OpenFDO

Authors B. R. Heap, M. S. Lynn

Publication date 1965

Published in Numerische Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

number theory

Cites work

• A graph-theoretic algorithm for the solution of a linear diophantine problem of Frobenius
• 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?)
• The index of primitivity of a non-negative matrix

Cited in

(10)

• On a conjecture about the exponent set of primitive matrices
• An algorithm for a linear Diophantine equation and a problem of Frobenius
• Ü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 7233012 (Why is no real title available?)
• The Frobenius problem for extended Thabit numerical semigroups
• scientific article; zbMATH DE number 7310235 (Why is no real title available?)
• scientific article; zbMATH DE number 7310252 (Why is no real title available?)
• Computational complexity of the original and extended Diophantine Frobenius problem

This page was built for publication: On a linear diophantine problem of Frobenius: an improved algorithm

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