F4 Algorithm For Euclidean Rings

Mathematics – Commutative Algebra

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

This short note is the generalization of Faugere F4-algorithm for polynomial
rings with coefficients in Euclidean rings. This algorithm computes
successively a Groebner basis replacing the reduction of one single
s-polynomial in Buchberger's algorithm by the simultaneous reduction of several
polynomials.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

F4 Algorithm For Euclidean Rings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with F4 Algorithm For Euclidean Rings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and F4 Algorithm For Euclidean Rings will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-29631

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.