A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension.
Simone NaldiVincent NeigerPublished in: ISSAC (2020)
Keyphrases
- dynamic programming
- detection algorithm
- high accuracy
- computational complexity
- significant improvement
- experimental evaluation
- learning algorithm
- improved algorithm
- times faster
- linear programming
- np hard
- theoretical analysis
- objective function
- segmentation algorithm
- optimization algorithm
- clustering method
- recognition algorithm
- input data
- k means
- preprocessing
- optimal solution
- genetic programming
- computationally efficient
- simulated annealing
- evolutionary algorithm
- search space
- computational efficiency
- high dimensional
- constrained optimization
- dimensional data