Complexity of the Frobenius problem

DOI10.1007/BF01300131MaRDI QIDQ1912748zbMATH OpenOpenAlexFDO

Authors Jorge Luis Ramírez Alfonsín

Publication date 14 May 1996

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01300131

zbMATH Keywords

Frobenius Problem

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Integer programming (90C10)

Recommendations

• Lattice translates of a polytope and the Frobenius problem
• scientific article; zbMATH DE number 18540
• Faster algorithms for Frobenius numbers

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

(58)

• A relation between the knapsack and group knapsack problems
• The Frobenius problem for the shuffle operation
• The Frobenius number for sequences of triangular and tetrahedral numbers
• On two-way nondeterministic finite automata with one reversal-bounded counter
• On the lattice programming gap of the group problems
• LLL-reduction for integer knapsacks
• Integer points in knapsack polytopes and s-covering radius
• The trouble with the second quantifier
• On two-generator Fibonacci numerical semigroups with a prescribed genus
• The square Frobenius number
• On the number of integer points in translated and expanded polyhedra
• Differentiable points of Sierpinski-like sponges
• Numerical semigroups of Szemerédi type
• Powers of matrices over distributive lattices -- a review
• Distributed graph problems through an automata-theoretic lens
• Exact and approximate results on the least size of a graph with a given degree set
• The minimal realization problem in the max-plus semiring and Pisot's problem are NP-hard
• The Frobenius problem for numerical semigroups with embedding dimension equal to three
• The Frobenius number in the set of numerical semigroups with fixed multiplicity and genus
• Proportionally modular Diophantine inequalities and the Stern-Brocot tree
• A Diophantine Frobenius problem related to Riemann surfaces
• Formulae for the Frobenius number in three variables
• On free numerical semigroups and the construction of minimal telescopic sequences
• scientific article; zbMATH DE number 7233012 (Why is no real title available?)
• Frobenius numbers and automatic sequences
• Partizan subtraction games
• Fractal patterns related to dividing coins
• The Frobenius Problem and Its Generalizations
• The Average State Complexity of the Star of a Finite Set of Words Is Linear
• The average state complexity of rational operations on finite languages
• Testing additive integrality gaps
• Universal number partition problem with divisibility
• An enumeration algorithm for all integers nonrepresentable by some positive integers
• The Frobenius problem in a free monoid
• Frobenius Coin-Exchange Generating Functions
• The Frobenius problem for extended Thabit numerical semigroups
• Optimizing sparsity over lattices and semigroups
• A plethora of polynomials: a toolbox for counting problems
• On numerical semigroups generated by primitive Pythagorean triplets
• Frobenius numbers of Pythagorean triples
• A Polyhedral Frobenius Theorem with Applications to Integer Optimization
• Factorizations of the same length in abelian monoids
• The set of Arf numerical semigroups with given Frobenius number
• The generalized Frobenius problem via restricted partition functions
• Numerical semigroups with monotone Apéry set and fixed multiplicity and ratio
• A combinatorial approach to Frobenius numbers of some special sequences
• The covariety of perfect numerical semigroups with fixed Frobenius number.
• The Apéry set for numerical semigroups of embedding dimension 4
• Equidistribution conditions for gaps of geometric numerical semigroups
• On the computation of the MED closure of a numerical semigroup
• Consistency of relations over monoids
• The extended Frobenius problem for r-Fibonacci sequences shifted by r-Fibonacci numbers
• An introduction to the theory of linear integer arithmetic (invited paper)
• Subalgebras of the univariate polynomial algebra
• Numerical semigroups: Apéry sets and Hilbert series.
• Opened modular numerical semigroups.
• Frobenius numbers of numerical semigroups generated by three consecutive squares or cubes.
• Gaps in semigroups

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)