On a linear diophantine problem of Frobenius
From MaRDI portal
Publication:5658129
DOI10.4064/AA-21-1-399-408zbMATH Open0246.10010OpenAlexW229079384MaRDI QIDQ5658129FDOQ5658129
Publication date: 1972
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/205124
Recommendations
Cited In (46)
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
- Numerical semigroups generated by primes
- Performance of linear-space search algorithms
- Title not available (Why is that?)
- An optimal lower bound for the Frobenius problem
- Title not available (Why is that?)
- The Frobenius postage stamp problem, and beyond
- The Frobenius problem, rational polytopes, and Fourier-Dedekind sums
- A relation between the knapsack and group knapsack problems
- Title not available (Why is that?)
- A discrete Farkas lemma
- On a linear Diophantine problem of Frobenius.
- A Polyhedral Frobenius Theorem with Applications to Integer Optimization
- On a linear diophantine problem for geometrical type sequences
- Nilpotent groups are round.
- Proof of a conjecture by Erdős and Graham concerning the problem of Frobenius
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the linear diophantine problem of Frobenius
- Periodic oscillations of coefficients of power series that satisfy functional equations
- A diophantine problem of Frobenius in terms of the least common multiple
- Some results in additive number theory I: The critical pair theory
- Weighted multi-connected loop networks
- Linear diophantine problems
- On consecutive subset sums
- Expected Frobenius numbers
- Refined upper bounds for the linear Diophantine problem of Frobenius
- On the extremal aspect of the Frobenius problem
- Performance of linear-space search algorithms
- More on change-making and related problems
- Centralizers in free group algebras and nonsingular curves
- Short rational generating functions for lattice point problems
- Title not available (Why is that?)
- A multiple set version of the \(3k-3\) theorem
- Differentiable points of Sierpinski-like sponges
- Weak asymptotics for the numbers of solutions of Diophantine problems
- The diophantine problem of Frobenius: A close bound
- Integer points in knapsack polytopes and \(s\)-covering radius
- Frobenius problem for semigroups \(\mathbf S(d_1,d_2,d_3)\).
- On the number of solutions to linear Diophantine equation and Frobenius problem
- Bounds on the size of branch-and-bound proofs for integer knapsacks
- Chrobak Normal Form Revisited, with Applications
- Frobenius Numbers and Automatic Sequences
- Finite automata and unary languages
- Noether resolutions in dimension 2
This page was built for publication: On 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 Q5658129)