4
$\begingroup$

Recently (January 2017) a paper by A. Tripathi has been published in the Journal of Number Theory with "closed" formulas for the Frobenius number in 3 variables (Formulae for the Frobenius number in three variables).

Question: Have Tripathi's formulas less computational complexity than already known algorithms (Greenberg, Rödseth) in some case?

Improve this question
$\endgroup$
6
  • 5
    $\begingroup$ I think we decided some time ago that MO was not a suitable place for fishing expeditions on recent publications. $\endgroup$
    – Gerry Myerson
    Commented Feb 4, 2018 at 22:19
  • 1
    $\begingroup$ @FelipeVoloch I've specified my question. $\endgroup$
    – Jose Brox
    Commented Feb 7, 2018 at 22:17
  • 1
    $\begingroup$ A better (for this forum) formulation would be "has there been any recent comparison or evaluation of these results against classical algorithms? While endorsement would be nice, I am interested in relative performance for computational purposes." , or something like this, which is more free of opinion and more possibility to be objective. If the question is made even more objective, I will vote to reopen. Gerhard "One Less Than Four For's" Paseman, 2018.02.07. $\endgroup$
    – Gerhard Paseman
    Commented Feb 7, 2018 at 23:07
  • 1
    $\begingroup$ @GerhardPaseman Rödseth's formula for Frobenius number gives an algorithm with the same complexity as Euclidean algorithm. Unlikely any other algorithm will be better. $\endgroup$
    – Alexey Ustinov
    Commented Feb 8, 2018 at 12:00
  • 1
    $\begingroup$ @GerhardPaseman Original Rödseth's algorithm can be easely improved because negative continued fraction is a simple transformation of usual continued fraction. I kept in mind this improvement as Rödseth's algorithm. As I understand it is the same as Greenberg's algorithm. $\endgroup$
    – Alexey Ustinov
    Commented Feb 8, 2018 at 13:50

0

Reset to default

You must log in to answer this question.

Browse other questions tagged .