Solving Detachability Problem for the Polynomial Ring by Signature-based Groebner Basis Algorithms

Details Solving Detachability Problem for the Polynomial Ring by Signature-based Groebner Basis Algorithms Solving Detachability Problem for the Polynomial Ring by Signature-based Groebner Basis Algorithms

2011-08-05

arxiv.org/abs/1108.1301v1

Computer Science

Symbolic Computation

Scientific paper

Signature-based algorithms are a popular kind of algorithms for computing Groebner basis, including the famous F5 algorithm, F5C, extended F5, G2V and the GVW algorithm. In this paper, an efficient method is proposed to solve the detachability problem. The new method only uses the outputs of signature-based algorithms, and no extra Groebner basis computations are needed. When a Groebner basis is obtained by signature-based algorithms, the detachability problem can be settled in polynomial time.

Affiliated with

Also associated with

No associations

Rating

Solving Detachability Problem for the Polynomial Ring by Signature-based Groebner Basis Algorithms 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 Solving Detachability Problem for the Polynomial Ring by Signature-based Groebner Basis Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving Detachability Problem for the Polynomial Ring by Signature-based Groebner Basis Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-668428