|
#10
![]() Irreducibility and GCD algorithms for sparse polynomialsFilaseta, Schinzel.Категория: Papers, Computer algebra
103 Kb
#19
![]() Fraction-free Computation of Matrix Rational Interpolants and GCDsBeckermann B., Labahn G.
344 Kb
#27
![]() Grigoriev. Complexity of factoring and GCD of linear differential operators (JSC1990)(L)(T)(16s).djvu
603 Kb
#29
![]() Beckermann, Labahn. Euclidean algorithm for numerical polynomial GCD. JSC 1998(T)(24s).djvu
201 Kb
#38
![]() Grigoriev. Complexity of factoring and GCD of linear differential operators (JSC1990)(16s).djvu
602 Kb
|
|