An enumeration algorithm for all integers nonrepresentable by some positive integers

DOI10.1016/J.IPL.2014.09.028zbMATH Open1353.11113OpenAlexW2034593573MaRDI QIDQ477659FDOQ477659

Authors: Shunichi Matsubara 

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.028

Recommendations

• An algorithm for the Frobenius problem
• On a linear Diophantine problem of Frobenius.
• Faster algorithms for Frobenius numbers
• The Frobenius problem for classes of polynomial solvability.
• An algorithm for solving the Frobenius problem using Gröbner bases

zbMATH Keywords

analysis of algorithmsFrobenius numberenumeration algorithmamortized analysisamortized polynomial-time delay

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Number-theoretic algorithms; complexity (11Y16) Computer solution of Diophantine equations (11Y50) The Frobenius problem (11D07)

Cites Work

• Introduction to algorithms
• On the linear diophantine problem of Frobenius.
• Title not available (Why is that?)
• Lattice translates of a polytope and the Frobenius problem
• Complexity of the Frobenius problem
• Short rational generating functions for lattice point problems
• Faster algorithms for Frobenius numbers
• The diophantine problem of Frobenius: A close bound
• A Minimal-Path Algorithm for the "Money Changing Problem"

Cited In (1)

• An algorithm for enumerating all infinite repetitions in a D0L-system

This page was built for publication: An enumeration algorithm for all integers nonrepresentable by some positive integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477659)