Frobenius numbers by lattice point enumeration
From MaRDI portal
Publication:3428596
Recommendations
Cited in
(22)- The Frobenius Problem and Its Generalizations
- Solving thousand-digit Frobenius problems using Gröbner bases
- Faster algorithms for Frobenius numbers
- Integer matrices, sublattices of \(\mathbb Z^m\), and Frobenius numbers
- Computing the Frobenius number
- Expected Frobenius numbers
- Weak asymptotics for the numbers of solutions of Diophantine problems
- Factoring in the Chicken McNugget monoid
- The short resolution of a semigroup algebra
- Commutative algebra of generalised Frobenius numbers
- A ``pseudo-polynomial algorithm for the Frobenius number and Gröbner basis
- Parametric polyhedra with at least \(k\) lattice points: their semigroup structure and the \(k\)-Frobenius problem
- Lattice Point Enumeration on Block Reduced Bases
- The Frobenius formula for \(A=(a,ha+d,ha+b_2 d, \ldots, ha+b_k d)\)
- Geometric proof of Rødseth's formula for Frobenius numbers
- The slice algorithm for irreducible decomposition of monomial ideals
- Formulae for the Frobenius number in three variables
- A fast and simple algorithm for the money changing problem
- A combinatorial approach to Frobenius numbers of some special sequences
- Mathematics and \texttt{Mathematica}
- Computing and Combinatorics
- The parametric Frobenius problem
This page was built for publication: Frobenius numbers by lattice point enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3428596)