Algorithms for Computing Groebner Bases of Polynomial Ideals over Various Euclidean Rings.

Abdelilah Kandri-Rody Deepak Kapur

Published in: EUROSAM (1984)

Keyphrases

computationally efficient
orders of magnitude
computational efficiency
neural network
markov random field
euclidean distance
graph theory
real time
data sets
learning algorithm
computational complexity
lower bound
significant improvement
optimization problems
times faster