Linear diophantine problems
From MaRDI portal
DOI10.1007/BF01323979zbMATH Open0854.11016OpenAlexW4249516687MaRDI QIDQ1924601FDOQ1924601
Authors: Mehdi Djawadi, Gerd Hofmeister
Publication date: 20 October 1996
Published in: Archiv der Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01323979
Recommendations
Cites Work
Cited In (14)
- Title not available (Why is that?)
- On regular Frobenius bases.
- The Frobenius problem for repunit numerical semigroups.
- Computational complexity of the original and extended Diophantine Frobenius problem
- The linear diophantine problem of Frobenius for subsets of arithmetic sequences
- An algorithm for a linear Diophantine equation and a problem of Frobenius
- On a linear diophantine problem for geometrical type sequences
- Title not available (Why is that?)
- On a linear Diophantine problem involving the Fibonacci and Lucas sequences
- Remark on linear forms
- Title not available (Why is that?)
- The Frobenius problem for Thabit numerical semigroups
- The Frobenius number in the set of numerical semigroups with fixed multiplicity and genus
- Computing the Frobenius number
This page was built for publication: Linear diophantine problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924601)