Computing the Frobenius number

MaRDI QIDQ3565989zbMATH OpenFDO

Authors Abdallah Badra

Publication date 7 June 2010

Mathematics Subject Classification ID

The Frobenius problem (11D07) Computer solution of Diophantine equations (11Y50)

Recommendations

• Frobenius numbers by lattice point enumeration
• Faster algorithms for Frobenius numbers
• An algorithm for the Frobenius problem
• Linear diophantine problems
• Some contributions to the Frobenius' Problem

Cited in

(7)

• The Frobenius number and a-invariant
• Faster algorithms for Frobenius numbers
• Frobenius numbers and automatic sequences
• scientific article; zbMATH DE number 4144048 (Why is no real title available?)
• scientific article; zbMATH DE number 563183 (Why is no real title available?)
• On regular Frobenius bases.
• Computations with Frobenius Powers

This page was built for publication: Computing the Frobenius number

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