On a linear diophantine problem of Frobenius
From MaRDI portal
(Redirected from Publication:5658129)
Recommendations
Cited in
(48)- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
- Numerical semigroups generated by primes
- Performance of linear-space search algorithms
- An optimal lower bound for the Frobenius problem
- On the Frobenius problem
- scientific article; zbMATH DE number 5041220 (Why is no real title available?)
- The Frobenius postage stamp problem, and beyond
- scientific article; zbMATH DE number 2202736 (Why is no real title available?)
- The Frobenius problem, rational polytopes, and Fourier-Dedekind sums
- A relation between the knapsack and group knapsack problems
- A discrete Farkas lemma
- scientific article; zbMATH DE number 7651168 (Why is no real title available?)
- On a linear Diophantine problem of Frobenius.
- Chrobak normal form revisited, with applications
- 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
- scientific article; zbMATH DE number 4006336 (Why is no real title available?)
- scientific article; zbMATH DE number 4085735 (Why is no real title available?)
- On the linear diophantine problem of Frobenius
- scientific article; zbMATH DE number 3582234 (Why is no real title available?)
- Periodic oscillations of coefficients of power series that satisfy functional equations
- A diophantine problem of Frobenius in terms of the least common multiple
- On a linear Diophantine problem involving the Fibonacci and Lucas sequences
- Some results in additive number theory I: The critical pair theory
- Expected Frobenius numbers
- Weighted multi-connected loop networks
- On consecutive subset sums
- Linear diophantine problems
- Refined upper bounds for the linear Diophantine problem of Frobenius
- On the extremal aspect of the Frobenius problem
- More on change-making and related problems
- Frobenius numbers and automatic sequences
- Performance of linear-space search algorithms
- Centralizers in free group algebras and nonsingular curves
- Short rational generating functions for lattice point problems
- 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 S(d₁,d₂,d₃).
- On the number of solutions to linear Diophantine equation and Frobenius problem
- Bounds on the size of branch-and-bound proofs for integer knapsacks
- Unbounded discrepancy in Frobenius numbers
- 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)
