Details:
Title  An efficient implementation for computing Gr\"obner bases over algebraic number fields.  Author(s)  Masayuki Noro  Type  Book, Chapter in Book, Conference Proceeding  Abstract  In this paper we discuss Gröbner basis computation over algebraic number fields. Buchberger algorithm can be executed over any computable field, but the computation is often inefficient if the field operations for algebraic numbers are directly used. Instead we can execute the algorithm over the rationals by adding the defining polynomials to the input ideal and by setting an elimination order. In this paper we propose another method, which is a combination of the two methods above. We implement it in a computer algebra system Risa/Asir and examine its efficiency.  ISBN  9783540380849/pbk 
URL 
http://link.springer.com/chapter/10.1007%2F11832225_9 
Language  English  Pages  99109  Publisher  Berlin: Springer  Year  2006  Edition  0  Translation 
No  Refereed 
No 
