Complexity of the Frobenius problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4095566 (Why is no real title available?)
- scientific article; zbMATH DE number 3582234 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Lattice translates of a polytope and the Frobenius problem
- On the linear diophantine problem of Frobenius.
- Solution to a linear diophantine equation for nonnegative integers
Cited in
(51)- The set of Arf numerical semigroups with given Frobenius number
- The Frobenius problem in a free monoid
- Testing additive integrality gaps
- A combinatorial approach to Frobenius numbers of some special sequences
- On free numerical semigroups and the construction of minimal telescopic sequences
- Optimizing sparsity over lattices and semigroups
- Universal number partition problem with divisibility
- Factorizations of the same length in abelian monoids
- On the number of integer points in translated and expanded polyhedra
- Proportionally modular Diophantine inequalities and the Stern-Brocot tree
- A relation between the knapsack and group knapsack problems
- Partizan subtraction games
- scientific article; zbMATH DE number 7233012 (Why is no real title available?)
- On two-generator Fibonacci numerical semigroups with a prescribed genus
- A plethora of polynomials: a toolbox for counting problems
- A Polyhedral Frobenius Theorem with Applications to Integer Optimization
- The Frobenius problem for numerical semigroups with embedding dimension equal to three
- Powers of matrices over distributive lattices -- a review
- A Diophantine Frobenius problem related to Riemann surfaces
- Gaps in semigroups
- Formulae for the Frobenius number in three variables
- On the lattice programming gap of the group problems
- The trouble with the second quantifier
- The Average State Complexity of the Star of a Finite Set of Words Is Linear
- LLL-reduction for integer knapsacks
- The square Frobenius number
- Frobenius numbers of numerical semigroups generated by three consecutive squares or cubes.
- The Frobenius problem for extended Thabit numerical semigroups
- The generalized Frobenius problem via restricted partition functions
- An enumeration algorithm for all integers nonrepresentable by some positive integers
- The minimal realization problem in the max-plus semiring and Pisot's problem are \(NP\)-hard
- Fractal patterns related to dividing coins
- Frobenius numbers and automatic sequences
- Numerical semigroups with monotone Apéry set and fixed multiplicity and ratio
- Opened modular numerical semigroups.
- The average state complexity of rational operations on finite languages
- Frobenius numbers of Pythagorean triples
- Numerical semigroups of Szemerédi type
- The covariety of perfect numerical semigroups with fixed Frobenius number.
- Differentiable points of Sierpinski-like sponges
- The Frobenius number in the set of numerical semigroups with fixed multiplicity and genus
- Integer points in knapsack polytopes and \(s\)-covering radius
- Distributed graph problems through an automata-theoretic lens
- Frobenius Coin-Exchange Generating Functions
- Numerical semigroups: Apéry sets and Hilbert series.
- On numerical semigroups generated by primitive Pythagorean triplets
- The Frobenius problem for the shuffle operation
- Exact and approximate results on the least size of a graph with a given degree set
- On two-way nondeterministic finite automata with one reversal-bounded counter
- The Frobenius number for sequences of triangular and tetrahedral numbers
- The Frobenius Problem and Its Generalizations
This page was built for publication: Complexity of the Frobenius problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1912748)
