A "pseudo-polynomial" algorithm for the Frobenius number and Gröbner basis.
Marcel MoralesNguyen Thi DungPublished in: J. Symb. Comput. (2024)
Keyphrases
- computational complexity
- learning algorithm
- computational effort
- times faster
- optimization algorithm
- dynamic programming
- detection algorithm
- computational cost
- high accuracy
- theoretical analysis
- experimental evaluation
- significant improvement
- probabilistic model
- small number
- numerically stable
- linear programming
- memory requirements
- polynomially bounded
- space complexity
- recognition algorithm
- preprocessing
- k means
- expectation maximization
- data structure
- clustering method
- matching algorithm
- similarity measure
- computer vision
- single scan
- neural network
- cost function