An enumeration algorithm for all integers nonrepresentable by some positive integers

DOI10.1016/J.IPL.2014.09.028MaRDI QIDQ477659zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 2229032 (Why is no real title available?)
• A Minimal-Path Algorithm for the "Money Changing Problem"
• Complexity of the Frobenius problem
• Faster algorithms for Frobenius numbers
• Introduction to algorithms
• Lattice translates of a polytope and the Frobenius problem
• On the linear diophantine problem of Frobenius.
• Short rational generating functions for lattice point problems
• The diophantine problem of Frobenius: A close bound

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)