"One Sugar cube, Please" or Selection Strategies in the Buchberger Algorithm.
Alessandro GioviniTeo MoraGianfranco NiesiLorenzo RobbianoCarlo TraversoPublished in: ISSAC (1991)
Keyphrases
- selection strategies
- cost function
- computational cost
- selection strategy
- matching algorithm
- learning algorithm
- np hard
- search space
- dynamic programming
- worst case
- simulated annealing
- optimal solution
- objective function
- lower bound
- information retrieval systems
- optimization algorithm
- detection algorithm
- computational complexity