Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions.

Jérémy Berthomieu Vincent Neiger Mohab Safey El Din

Published in: ISSAC (2022)

Keyphrases

experimental evaluation
cost function
computational complexity
k means
dynamic programming
high accuracy

learning algorithm
times faster
matching algorithm
probabilistic model
segmentation algorithm
objective function

detection algorithm
expectation maximization
simulated annealing
np hard
preprocessing
linear programming

worst case
optimization algorithm
computational cost
segmentation method
highly efficient
numerically stable