Time complexity of Tripathi’s three-variable Frobenius algorithm

Determine the worst-case time complexity of A. Tripathi’s three-variable-specific algorithm for computing the Frobenius number.

Background

The paper compares its algorithm with earlier methods for the Frobenius problem in three variables. It identifies Tripathi’s 2017 algorithm as being based on the Brauer–Shockley theorem, but notes that the computational cost of that algorithm had not been established. Determining its time complexity would allow a meaningful complexity comparison with Greenberg’s algorithm and with the algorithm developed in the paper.