Complexity of the Frobenius problem
From MaRDI portal
Publication:1912748
DOI10.1007/BF01300131zbMath0847.68036OpenAlexW1506489923MaRDI QIDQ1912748
Publication date: 14 May 1996
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01300131
Integer programming (90C10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Optimizing Sparsity over Lattices and Semigroups ⋮ The Frobenius problem for numerical semigroups with embedding dimension equal to three ⋮ Formulae for the Frobenius number in three variables ⋮ Unnamed Item ⋮ The Frobenius problem for the shuffle operation ⋮ A Plethora of Polynomials: A Toolbox for Counting Problems ⋮ Opened modular numerical semigroups. ⋮ Fractal patterns related to dividing coins ⋮ The square Frobenius number ⋮ Testing additive integrality gaps ⋮ LLL-reduction for integer knapsacks ⋮ Unnamed Item ⋮ Factorizations of the same length in abelian monoids ⋮ Numerical semigroups of Szemerédi type ⋮ Frobenius numbers of numerical semigroups generated by three consecutive squares or cubes. ⋮ Frobenius Numbers and Automatic Sequences ⋮ Partizan Subtraction Games ⋮ Universal number partition problem with divisibility ⋮ The set of Arf numerical semigroups with given Frobenius number ⋮ Distributed graph problems through an automata-theoretic lens ⋮ The generalized Frobenius problem via restricted partition functions ⋮ Numerical semigroups with monotone Apéry set and fixed multiplicity and ratio ⋮ Integer points in knapsack polytopes and \(s\)-covering radius ⋮ Exact and approximate results on the least size of a graph with a given degree set ⋮ The Frobenius number for sequences of triangular and tetrahedral numbers ⋮ The Frobenius number in the set of numerical semigroups with fixed multiplicity and genus ⋮ The Frobenius Problem and Its Generalizations ⋮ The Average State Complexity of the Star of a Finite Set of Words Is Linear ⋮ An enumeration algorithm for all integers nonrepresentable by some positive integers ⋮ On Free Numerical Semigroups and the Construction of Minimal Telescopic Sequences ⋮ On the number of integer points in translated and expanded polyhedra ⋮ Gaps in semigroups ⋮ On two-way nondeterministic finite automata with one reversal-bounded counter ⋮ THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES ⋮ Proportionally modular diophantine inequalities and the Stern-Brocot tree ⋮ On the lattice programming gap of the group problems ⋮ Differentiable points of Sierpinski-like sponges ⋮ Numerical semigroups: Apéry sets and Hilbert series. ⋮ Frobenius Coin-Exchange Generating Functions ⋮ The trouble with the second quantifier ⋮ On two-generator Fibonacci numerical semigroups with a prescribed genus ⋮ A relation between the knapsack and group knapsack problems ⋮ A DIOPHANTINE FROBENIUS PROBLEM RELATED TO RIEMANN SURFACES ⋮ A Polyhedral Frobenius Theorem with Applications to Integer Optimization ⋮ Unnamed Item ⋮ Frobenius numbers of Pythagorean triples ⋮ Powers of matrices over distributive lattices -- a review
Cites Work
