On the number of solutions to linear Diophantine equation and Frobenius problem
From MaRDI portal
Publication:2088674
DOI10.1134/S0965542522090044OpenAlexW4298325892MaRDI QIDQ2088674
Eh. N. Gordeev, V. K. Leont'ev
Publication date: 6 October 2022
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542522090044
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Frobenius problem for repunit numerical semigroups.
- Formulae for the Frobenius number in three variables
- Weak asymptotics for the numbers of solutions of Diophantine problems
- Committees of systems of linear inequalities
- Generating functions in the knapsack problem
- On combinatorial properties of the knapsack problem
- The Frobenius problem for Thabit numerical semigroups
- The Frobenius problem for Mersenne numerical semigroups
- On formulas for the Frobenius number of a numerical semigroup.
- A Minimal-Path Algorithm for the "Money Changing Problem"
- On a linear diophantine problem of Frobenius
This page was built for publication: On the number of solutions to linear Diophantine equation and Frobenius problem
