Return to bib.tex CVS log

Up to [local] / OpenXM / doc / compalg

Annotation of OpenXM/doc/compalg/bib.tex, Revision 1.2

1.1       noro        1: \begin{thebibliography}{99}
                      2: \bibitem{ABBOTT}
                      3: Abbott, J.A. et al, Factorisation of Polynomials: Old Ideas and Recent Results.
                      4: Trends in Computer Algebra (LNCS 296), 81-91.
                      5:
                      6: \bibitem{ADAMS}
                      7: Adams, W., Loustaunau, P., An Introduction to Gr\"bner Bases. Graduate
                      8: Strudies in Mathematics, Vol. 3., AMS (1994).
                      9:
                     10: \bibitem{ABRW}
                     11: Alonso, M. E., Becker, E., Roy, M. F., W\"ormann, T., Zeros,
                     12: Multiplicities and Idempotents for Zerodimensinal Systems.
                     13: Proc. MEGA94, Birkh\"auser (1996).
                     14:
                     15: \bibitem{BW}
                     16: Becker, T., Weispfenning, V., Gr\"obner Bases. GTM 141, Springer-Verlag(1993).
                     17:
                     18: \bibitem{BERL}
                     19: Berlekamp, E.R., Factoring Polynomials over Large Finite Fields.
                     20: Math. Comp. 24 (1970), 713-735.
                     21:
                     22: \bibitem{GC}
                     23: Boehm, H.,Weiser, M., Garbage Collection in an Uncooperative Environment.
                     24: Software Practice \& Experience(September 1988), 807-820.
                     25:
                     26: {\tt http://reality.sgi.com/boehm\_mti/gc.html}
                     27:
                     28: \bibitem{BUCH}
                     29: Buchberger, B., Ein algorithmisches Kriterium {f\"ur} die
                     30: {L\"osbarkeit} eines algebraischen Geichungssystems. Aequ. Math. 4/3
                     31: (1970), 374-383.
                     32:
                     33: \bibitem{CZ}
                     34: Cantor, D.G., Zassenhaus, H., On Algorithms for Factoring
                     35: Polynomials over Finite Fields.
                     36: Math. Comp. 36 (1981), 587-592.
                     37:
                     38: \bibitem{WALK}
                     39: Collart, M. et al, Converting Bases with the Gr\"obner Walk.
                     40: J. Symb. Comp. 24/3/4(1997), 465-469.
                     41:
                     42: \bibitem{COX}
                     43: Cox, D., Little, J., O'Shea, D., Ideals, Varieties, and Algorithms.
                     44: UTM, Springer-Verlag (1992).
                     45:
                     46: \bibitem{COX2}
                     47: Cox, D., Little, J., O'Shea, D., Using Algebraic Geometry.
                     48: GTM 185, Springer-Verlag (1998).
                     49:
                     50: \bibitem{DAV}
                     51: Davenport, J.H. et al, Computer Algebra. Academic Press (1988).
                     52:
                     53: \bibitem{DIXON}
                     54: Dixon, J. D., Exact Solution of Linear Equations Using P-Adic Expansions.
                     55: Numerische Mathematik {\bf 40} (1982), 137-141.
                     56:
                     57: \bibitem{EISEN}
                     58: Eisenbud, D., Commutative Algebra with a View Toward Algebraic Geometry.
                     59: GTM 150, Springer-Verlag (1995).
                     60:
                     61: \bibitem{FGLM}
                     62: Faug\`ere, J.C., Gianni, P., Lazard, D., Mora, T., Efficient
                     63: Computation of Zero-dimensional Gr\"obnerr Bases by Change of Ordering. J.
                     64: Symb. Comp. 16/4(1993), 329-344.
                     65:
                     66: \bibitem{F}
                     67: Faug\`ere, J.C.,
                     68: A new efficient algorithm for computing Groebner bases  ($F_4$),
                     69: Journal of Pure and Applied Algebra (139) 1-3 (1999), 61-88.
                     70:
                     71: \bibitem{GEB}
                     72: Gebauer, R., M\"oller, H.M., On an installation of Buchberger's algorithm.
                     73: J. Symb. Comp. 6/2/3(1989), 275-286.
                     74:
                     75: \bibitem{GEDDES}
                     76: Geddes, K.O. et al., Algorithms for Computer Algebra.
                     77: Kluwer Academic Publishers, Boston (1992).
                     78:
                     79: \bibitem{GEL}
                     80: Gel'fond, A.O., Transcendental and Algebraic Numbers. New York, Dover (1960).
                     81:
                     82: \bibitem{GTZ}
                     83: Gianni, P., Trager, B., Zacharias, G., Gr\"obner bases and primary
                     84: decomposition of polynomial ideals. J. Symb. Comp. 6/2,3(1988), 149-167.
                     85:
                     86: \bibitem{SUGAR}
                     87: Giovini, A., Mora, T., Nielsi, G., Robbiano, L., Traverso, C., ``One
                     88: sugar cube, please'' OR Selection strategies in the Buchberger
                     89: algorithm.  Proc. ISSAC '91, 49-54.
                     90:
                     91: \bibitem{KR}
                     92: $B%+!<%K%O%s(B, B.W., $B%j%C%A!<(B, D.M., $B%W%m%0%i%_%s%08@8l(B C $BBh(B 2 $BHG(B.
                     93: $B6&N)=PHG(B (1989).
                     94:
                     95: \bibitem{KNUTH}
                     96: Knuth, D.E., The Art of Computer Programming, Vol. 2.
                     97: Seminumerical Algorithms, 2nd ed. Addison-Wesley (1981).
                     98:
                     99: \bibitem{SUB}
                    100: Loos, R., Generalized Polynomial Remainder Sequences.
                    101: Computing, Suppl. 4 (1982), 115-137.
                    102:
                    103: \bibitem{MIG}
                    104: Mignotte, M., Mathematics for Computer Algebra.
                    105: Springer-Verlag (1982).
                    106:
                    107: \bibitem{YUN}
                    108: Moses, J., Yun, D.Y.Y., The EZ GCD Algorithm, Proc. ACM Annual
                    109: Conf. (1973), 159-166.
                    110:
                    111: \bibitem{NAGAO}
                    112: $B1JHxHF(B, $BBe?t3X(B.
                    113: $B?7?t3X9V:B(B 4, $BD+AR=qE9(B (1983).
                    114:
                    115: \bibitem{REP}
                    116: Noro, M., J. McKay,
                    117: Computation of replicable functions on Risa/Asir.
                    118: Proc. PASCO'97, ACM Press (1997), 130-138.
                    119:
                    120: \bibitem{NS}
1.2     ! noro      121: Noro, M. et al, Asir.
1.1       noro      122:
                    123: {\tt ftp://archives.cs.ehime-u.ac.jp/pub/asir2000}
                    124:
                    125: \bibitem{NT}
                    126: Noro, M., Takeshima, T., Risa/Asir --- A Computer Algebra system.
                    127: Proc. ISSAC'92, ACM Press(1992), 387-396.
                    128:
                    129: \bibitem{NY}
                    130: Noro, M., Yokoyama, K., New methods for the change-of-ordering in Gr\"obner
                    131: basis computation. Research Report ISIS-RR-95-8E, FUJITSU LABS, ISIS
                    132: (1995).
                    133:
                    134: \bibitem{NY2}
                    135: Noro, M., Yokoyama, K., A Modular Method to Compute the
                    136: Rational Univariate Representation of Zero-Dimensional Ideals.
                    137: J. Symb. Comp. {\bf 28}/1 (1999), 243-263.
                    138:
                    139: \bibitem{OAKU}
                    140: $BBg0$5W=SB'(B, $B%0%l%V%J4pDl$H@~7?JPHyJ,J}Dx<07O(B ($B7W;;Be?t2r@OF~Lg(B).
                    141: $B>eCRBg3X?t3X9V5fO?(B No. 38 (1994).
                    142:
                    143: \bibitem{ROBBIANO}
                    144: Robbiano, L., Term orderings on the polynomial ring. Proc. EUROCAL'85 (LNCS 204), 513-517.
                    145:
                    146: \bibitem{SASAKI}
                    147: $B:4!9LZ7z><(B, $B?t<0=hM}(B. $B>pJs=hM}AQ=q(B 7, $B>pJs=hM}3X2q(B (1981).
                    148:
                    149: \bibitem{SY}
                    150: Shimoyama, T., Yokoyaka, K., Localization and Primary Decomposition of
                    151: Polynomial ideals. J. Symb. Comp. 22(1996), 247-277.
                    152:
                    153: \bibitem{TAKAGI}
                    154: $B9bLZDg<#(B, $B=iEy@0?tO@9V5A(B $BBh(B 2 $BHG(B. $B6&N)=PHG(B (1971).
                    155:
                    156: \bibitem{TAKAGI2}
                    157: $B9bLZDg<#(B, $BBe?t3X9V5A(B $B2~D{?7HG(B. $B6&N)=PHG(B (1965).
                    158:
                    159: \bibitem{GMP}
                    160: Torbj\"orn et al, GNU MP library. Free Software Foundation (1996).
                    161:
                    162: {\tt http://www.fsf.org/software/gmp/gmp.html}
                    163:
                    164: \bibitem{TRAGER}
                    165: Trager, B.M., Algebraic Factoring and Rational Function Integration.
                    166: Proc. SYMSAC 76, 219-226.
                    167:
                    168: \bibitem{TRAV}
                    169: Traverso, C., Gr\"obner trace algorithms. Proc. ISSAC '88 (LNCS 358), 125-138.
                    170:
                    171: \bibitem{WANG}
                    172: Wang, P.S., An Improved Multivariate Polynomial Factoring Algorithm.
                    173: Math. Comp. 32(1978), 1215-1231.
                    174:
                    175: \bibitem{WANG2}
                    176: Wang, P.S. et al, p-adic Reconstruction of Rational Numbers.
                    177: SIGSAM Bulletin 16(1982), 2-3.
                    178:
                    179: \bibitem{SQFR}
                    180: Wang, P.S., Trager, B.M., New Algorithms for Polynomial Square-Free Decomposition over the Integers.
                    181: SIAM J. Comp. 8(1979), 300-305.
                    182:
                    183: \bibitem{BMOD}
                    184: Weber, K., The Accelerated Integer GCD Algorithm. ACM Transactions on Mathematic
                    185: al Software, Vol. 21, No. 1 (1995), 111-122.
                    186:
                    187: \bibitem{SYMP}
                    188: $B5HED=UIW(B, $B%7%s%W%l%/%F%#%C%/?tCM2rK!(B.
                    189: $B?tM}2J3X(B, 33, 6 (1995), 27-46.
                    190:
                    191: \bibitem{ZASS}
                    192: Zassenhaus, H., On Hensel Factorization I.
                    193: J. Number Theory 1 (1969), 291-311.
                    194: \end{thebibliography}
                    195:
                    196: $BK\9V$G$O(B, $BM=HwCN<1$H$7$F(B, $B@~7ABe?t$*$h$SBe?t3X$N4pACE*$JFbMF$r2>Dj$7$F(B
                    197: $B$$$k(B. $B8e<T$K4X$7$F$O(B, $B6qBNE*$K$O72(B, $B4D(B, $BBN$J$I$NBe?t7O$K4X$9$k4pACE*;v(B
                    198: $B9`(B, $BFC$KBN$N3HBg$*$h$S%$%G%"%k$K4X$9$kCN<1$r;}$C$F$$$k$3$H$,K>$^$7(B
                    199: $B$$(B. $BNc$($P(B \cite{NAGAO} $B$J$I$rA&$a$k(B. \cite{KNUTH} $B$O(B, $B?t(B, $BB?9`<0$K4X(B
                    200: $B$9$k$5$^$6$^$J%"%k%4%j%:%`$,>\:Y$+$D@53N$K2r@b$5$l$F$$$F(B, $B<-=qE*$K;H$((B
                    201: $B$k(B. \cite{DAV}\cite{GEDDES}\cite{SASAKI} $B$O7W;;5!Be?t$N652J(B
                    202: $B=q(B. \cite{ADAMS}\cite{BW}\cite{COX}\cite{COX2}\cite{EISEN}\cite{OAKU}
                    203: $B$O%0%l%V%J4pDl$"$k$$$O2D49Be?t$K4X$9$k652J=q(B. \cite{KR} $B$O(B C $B8@8l$NI8(B
                    204: $B=`E*$J2r@b=q$G$"$k(B.
                    205:
                    206: $B0J2<(B, $B3F>O$K4X$7(B, $B;29M=q(B, $BO@J8$r5s$2$J$,$i4JC1$K?6$jJV$k(B.
                    207:
                    208: \noi
                    209: $BBh(B 2 $B>O(B:
                    210:
                    211: $B$3$3$G=R$Y$?$N$O(B, CPU $B$*$h$S(B C $B8@8l$K4X$9$k:GDc8B$N$3$H$,$i$G$"$k(B. CPU
                    212: $B$K4X$7$F$O(B, $BJ8;zDL$j(B CPU $BKh$K%^%K%e%"%k$,B8:_$9$k$,(B, $B6=L#$N$"$kJ}$O(B,
                    213: $BNc$($P(B Pentium $B$J$I$N%^%K%e%"%k$rD/$a$F$_$F$O$I$&$@$m$&$+(B. C $B8@8l$K4X(B
                    214: $B$7$F$O?t$(@Z$l$J$$Dx$N2r@b=q$,$"$k$,(B, $BI.<T$O(B \cite{KR}$B$NB>$K$O(B, $B2?$i$+(B
                    215: $B$N%U%j!<%=%U%H%&%'%"$N%=!<%9%3!<%I$rFI$`$3$H$r$*4+$a$9$k(B. $BFC$K(B, {\tt
                    216: gmp} \cite{GMP} $B$OBh(B 3 $B>O$G=R$Y$?%"%k%4%j%:%`$*$h$S$h$j?J$s$@%"%k%4%j%:(B
                    217: $B%`$,<BAu$5$l$F$*$j(B, $B;29M$K$J$k$H;W$&(B.
                    218:
                    219: \noi
                    220: $BBh(B 3 $B>O(B:
                    221:
                    222: $B$3$3$G:G$bM}2r$7$K$/$$$N$O=|;;%"%k%4%j%:%`$G$"$m$&(B. $B3FJdBj$N>ZL@$O(B
                    223: $B>JN,$7$F$"$k$N$G(B, $BN}=,LdBj$H$7$F2r$$$F$_$l$P=|;;%"%k%4%j%:%`$N;EAH$_(B
                    224: $B$,$h$/J,$+$k$H;W$&(B. $B$3$l$i$OA4$F(B \cite{KNUTH} $B$K>ZL@$,$"$k(B.
                    225: $B@0?t(B GCD $B$K$D$$$F$J$K$b=R$Y$J$+$C$?$,(B, Euclid $B8_=|K!$NB>$K(B binary
1.2     ! noro      226: GCD $B%"%k%4%j%:%`$H$h$P$l$k%?%$%W$N%"%k%4%j%:%`$,$"$j(B, $BG\@:EY@0?t=|;;(B
        !           227: $B$rMQ$$$J$$$?$a9bB.$K<B9T$G$-$k(B. $B$3$l$K4X$7$F$O$d$O$j(B \cite{KNUTH}
1.1       noro      228: $B$K2r@b$5$l$F$$$k(B. $B$^$?(B, $B:G6a$3$N%?%$%W$N%"%k%4%j%:%`$r$5$i$K?J2=(B
                    229: $B$5$;$?$b$N$,Ds0F$5$l$F$$$k(B. $B$3$l$K$D$$$F$O(B \cite{BMOD} $B;2>H(B.
                    230:
                    231: \noi
                    232: $BBh(B 4 $B>O(B:
                    233:
                    234: $BB?9`<0$r(B C $B$J$I$N9b5i8@8l$GI=8=$7(B, $B$=$N1i;;$r5-=R$7$F$_$k$3$H$O(B,
                    235: $B%W%m%0%i%_%s%0$N$h$$N}=,$K$J$k(B. $B$=$N:]$KLdBj$H$J$k$N$,(B, $BITMW$K$J$C$?(B
                    236: $B%a%b%jNN0h$N3+J|$K4X$9$k$3$H$G$"$k(B. C $B8@8l$G$O$3$l$O%W%m%0%i%^$N(B
                    237: $B@UG$$G$"$k$,(B, $B$3$l$r<j:n6H$G9T$&$3$H$O(B, $B3+J|$7K:$l$K$h$k%a%b%j%j!<%/(B,
                    238: $B$"$k$$$OITE,@Z$J3+J|$J$I(B, $B=EBg$+$D8+$D$1$K$/$$%P%0$N860x$H$J$j0W$$(B.
                    239: $B$3$l$rKI$0$?$a$K(B, \cite{GC} $B$G(B, $B<+F0%,!<%Y%C%8%3%l%/%?IU$-$N%a%b%j(B
                    240: $B4IM}$,Ds0F$5$l$?(B. $B$3$l$O%U%j!<$J%5%V%k!<%A%s%i%$%V%i%j$H$7$FMxMQ(B
                    241: $B$G$-$k(B. $B$3$N>O$G$O(B, $BB?9`<0>h;;$N9bB.%"%k%4%j%:%`$H$7$F(B Karatsuba $BK!(B
                    242: $B$N$_$r<h$j>e$2$?$,(B, $B9b<!(B ($B?t==<!0J>e(B) $B$NB?9`<0$N>h;;$,B?$/I,MW$J>l9g(B
                    243: $B$K$O(B FFT $B%"%k%4%j%:%`$,M-8z$J>l9g$b$"$k(B. $B$3$l$K$D$$$F$O(B \cite{KNUTH}
                    244: $B$r;2>H(B.
                    245:
                    246: \noi
                    247: $BBh(B 5 $B>O(B:
                    248:
                    249: $B$3$3$G=R$Y$i$l$F$$$k$3$H$N$&$A(B, $B8_=|K!$K4X$9$k$3$H$O(B Euclid $B4D$K$*$$$F(B
                    250: $B@.$jN)$D(B. $B$^$?(B, $B=*7k<0$K$D$$$F$O(B, $B$=$N=EMW@-$K$b$+$+$o$i$:(B, $B0lHLE*$J(B
                    251: $BBe?t3X$N9V5A$J$I$G>\$7$/07$o$l$k$3$H$O>/$J$$$H;W$o$l$k(B. \cite{TAKAGI2}
                    252: $B$J$I$GJY6/$7$F$_$F$[$7$$(B.
                    253:
                    254: \noi
                    255: $BBh(B 6 $B>O(B:
                    256:
                    257: $B$3$3$G07$o$l$F$$$kFbMF$O(B, $B7W;;5!Be?t8&5f$K$*$1$k0l$D$N%O%$%i%$%H$H$b8@(B
                    258: $B$($k$b$N$G$"$k(B. $BFC$K(B, $BM-8BBN>e$NB?9`<00x?tJ,2r$O(B, $BBJ1_6J@~0E9f$J$I$X$N(B
                    259: $BD>@\$N1~MQ$b$"$j(B, $B8=:_$b3hH/$K8&5f$5$l$F$$$k(B. $B$^$?(B, $BM-M}?tBN>e$N0x?tJ,(B
                    260: $B2r$b(B, $B?t3X$K$*$1$k<B83%D!<%k$H$7$F7W;;5!Be?t%7%9%F%`$rMQ$$$k>l9g$KBgJQ(B
                    261: $BM-8z$J5!G=$G$"$k(B. $B$3$N>O$NFbMF$N$&$A(B, $BM-8BBN(B, $BM-M}?tBN>e$N0lJQ?tB?9`<0(B
                    262: $B$N0x?tJ,2r$K4X$7$F$O(B \cite{KNUTH}, $BB?JQ?tB?9`<0$N0x?tJ,2r$K4X$7$F$O(B
                    263: \cite{SASAKI} $B$"$k$$$O(B \cite{GEDDES} $B$r;2>H(B.
                    264:
                    265: \noi
                    266: $BBh(B 7 $B>O(B, $BBh(B 8 $B>O(B:
                    267:
                    268: $B$3$3$G$O(B, $B%0%l%V%J4pDl(B, Buchberger $B%"%k%4%j%:%`$*$h$S$=$l$i$N1~MQ$K$D(B
                    269: $B$$$F$4$/4pK\E*$J$3$H$,$i$N$_$K8BDj$7$F=R$Y$F$$$k(B. $B>\$7$/$O(B,
                    270: \cite{COX} \cite{COX2} $B$r;2>H(B. $BFC$K(B \cite{COX2} $B$OBe?t4v2?(B, $B2D49Be?t(B
                    271: $B$N8&5f$N$?$a$N%D!<%k$H$J$k%"%k%4%j%:%`$K$D$$$F(B, $B%0%l%V%J4pDl$K8B$i$J$$(B
                    272: $B:G6a$N@.2L$b4^$a$FI}9-$/5-=R$5$l$F$$$k(B.
                    273:
                    274: \noi
                    275: $BBh(B 9 $B>O(B:
                    276:
                    277: $B$3$3$G$O(B, $BM}O@>e$b1~MQ>e$b=EMW$J%$%G%"%k$N=`AGJ,2r$K$D$$$F35@b$7$F$$$k(B.
                    278: $B%"%k%4%j%:%`$O$5$^$6$^$JItIJ$+$i@.$C$F$*$j(B, $B$=$l$i$N@bL@$K$D$$$F$O(B,
                    279: \cite{BW} $B$r;2>H(B. $B$J$*(B, $B$3$3$G=R$Y$?$N$H$O0[$J$k=`AGJ,2r%"%k%4%j%:%`$,(B
                    280: \cite{SY} $B$GDs0F$5$l$F$*$j(B, Risa/Asir $B$K<BAu$5$l$F$$$k(B.
                    281:
                    282: \noi
                    283: $BBh(B 10 $B>O(B, $BBh(B 11 $B>O(B:
                    284:
                    285: $B$3$l$i$N>O$O$d$dFC<l$JFbMF$r07$C$F$*$j(B, $B%0%l%V%J4pDl7W;;$r%D!<%k$H$7$F(B
                    286: $BMQ$$$k>l9g$K$OFC$K0U<1$9$kI,MW$O$J$$(B. $B$7$+$7(B, $B$=$l$rC1$J$kJXMx$J%V%i%C%/(B
                    287: $B%\%C%/%9$H9M$($k$H(B, $B$A$g$C$H$7$?LdBj$G$b$9$0$K7W;;$,GKC>$7$F$7$^$&$3$H(B
                    288: $B$OCN$C$F$*$/I,MW$,$"$k(B. $BG$0UF~NO$+$i$N%0%l%V%J4pDl7W;;$K$D$$$F$O(B,
                    289: $B:G6aDs0F$5$l$?(B $F_4$ $B%"%k%4%j%:%`(B \cite{F} $B$,M-NO$G$"$k$,(B, $B$^$@(B
                    290: $BHFMQ7W;;5!Be?t%7%9%F%`$J$I$K$O<BAu$5$l$F$$$J$$$h$&$G$"$k(B.
                    291: $B$^$?(B, change of ordering $B$K$D$$$F$O(B, $B$3$3$G=R$Y$?J}K!$NB>$K(B
                    292: \cite{WALK} $B$G0[$J$kJ}K!$,Ds0F$5$l$F$$$k(B. modular change of ordering
                    293: $B$*$h$S(B modular RUR $B$O(B Risa/Asir $B$K<BAu$5$l$F$$$k(B.
                    294: