Computing the Frobenius number

MaRDI QIDQ3565989zbMATHFDO

Authors Abdallah Badra

Publication date 7 June 2010

Mathematics Subject Classification ID

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

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)

• Computations with Frobenius Powers
• Faster algorithms for Frobenius numbers
• The Frobenius number and \(a\)-invariant
• 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.

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)