Computing the Frobenius number

zbMATH Open1237.11012MaRDI QIDQ3565989FDOQ3565989

Authors: Abdallah Badra 

Publication date: 7 June 2010

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

Mathematics Subject Classification ID

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

Cited In (7)

• On regular Frobenius bases.
• Title not available (Why is that?)
• Faster algorithms for Frobenius numbers
• Title not available (Why is that?)
• Frobenius numbers and automatic sequences
• Computations with Frobenius Powers
• The Frobenius number and \(a\)-invariant

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)