An enumeration algorithm for all integers nonrepresentable by some positive integers

DOI10.1016/j.ipl.2014.09.028zbMath1353.11113OpenAlexW2034593573MaRDI QIDQ477659

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

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) Computer solution of Diophantine equations (11Y50) Number-theoretic algorithms; complexity (11Y16) The Frobenius problem (11D07)

Cites Work

• Unnamed Item
• Unnamed Item
• The diophantine problem of Frobenius: A close bound
• Lattice translates of a polytope and the Frobenius problem
• Complexity of the Frobenius problem
• Faster algorithms for Frobenius numbers
• A Minimal-Path Algorithm for the "Money Changing Problem"
• On the linear diophantine problem of Frobenius.
• Short rational generating functions for lattice point problems

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