2 402 202 книги
Поиск книг
Жанры
Книги
Категории и жанры
Лучшие книги
Библиотека
Помощь
Мобильная версия
Контакты
Как помочь?
libcats.org
Самая большая
электронная библиотека
рунета. Поиск книг и журналов
↓
Только точные совпадения
#1
Bernstein fast gcd notes
Категория:
Papers
,
Numerical methods
,
GCD
4 Kb
#2
Algorithm 386. GCD of n integers and multipliers
Bradley.
Категория:
Papers
,
Numerical methods
,
GCD
140 Kb
#3
New Euclidean algorithm for GCD
Bradley.
Категория:
Papers
,
Numerical methods
,
GCD
157 Kb
#4
Euclid algorithm and polynomial GCD analysis
Brown.
Категория:
Papers
,
Numerical methods
,
GCD
255 Kb
#5
Generalization of Euclidean GCD
Jebelean.
Категория:
Papers
,
Numerical methods
,
GCD
52 Kb
#6
Lehmer-Euclid GCD algorithm
Jebelean.
Категория:
Papers
,
Numerical methods
,
GCD
86 Kb
#7
Fast computation of GCDs using Schoenhage
Moenck.
Категория:
Papers
,
Numerical methods
,
GCD
127 Kb
#8
Analysis of Lehmer's GCD algorithm. ISSAC95
Sorenson.
Категория:
Papers
,
Numerical methods
,
GCD
126 Kb
#9
Accelerated integer GCD. TOMS 1995
Weber.
Категория:
Papers
,
Numerical methods
,
GCD
170 Kb
#10
Irreducibility and GCD algorithms for sparse polynomials
Filaseta
,
Schinzel.
Категория:
Papers
,
Computer algebra
103 Kb
#11
GCDs and factoring multivariate polynomials using Groebner bases
Gianni
,
Trager.
Категория:
Papers
,
Computer algebra
,
Groebner bases
44 Kb
#12
The EZ polynomial GCD algorithm
Moses
,
Yun.
Категория:
Papers
,
Computer algebra
,
Groebner bases
154 Kb
#13
Euclidean algorithm for numerical polynomial GCD. JSC 1998
Beckermann
,
Labahn.
Категория:
Papers
,
Computer algebra
,
Polynomial factorization
201 Kb
#14
Approximate GCDs of polynomials JSC 1998
Karmarkar
,
Lakshman.
Категория:
Papers
,
Computer algebra
,
Polynomial factorization
97 Kb
#15
Computing GCDs of polynomials using black box 1995
Diaz
,
Kaltofen.
Категория:
Papers
,
Computer algebra
,
Polynomial factorization
,
Kaltofen
92 Kb
#16
GCD of polynomials using straight-line programs 1988
Kaltofen.
Категория:
Papers
,
Computer algebra
,
Polynomial factorization
,
Kaltofen
119 Kb
#17
Parallel computation of polynomial GCDs 1989
Kaltofen.
Категория:
Papers
,
Computer algebra
,
Polynomial factorization
,
Kaltofen
83 Kb
#18
Complexity of factoring and GCD of linear differential operators
Grigoriev.
Категория:
Papers
,
Computer algebra
,
Solving ODEs
603 Kb
#19
Fraction-free Computation of Matrix Rational Interpolants and GCDs
Beckermann B.
,
Labahn G.
344 Kb
#20
Weber. Accelerated integer GCD. TOMS 1995(T)(12s).djvu
170 Kb
#21
Sorenson. Analysis of Lehmer#s GCD algorithm. ISSAC95(T)(5s).djvu
126 Kb
#22
Moenck. Fast computation of GCDs using Schoenhage (ACM1973)(T)(10s).djvu
127 Kb
#23
Brown. Euclid algorithm and polynomial GCD analysis (SIGSAM1971)(T)(17s).djvu
255 Kb
#24
Bradley. New Euclidean algorithm for GCD (CACM 1970)(T)(4s).djvu
157 Kb
#25
Bradley. Algorithm 386. GCD of n integers and multipliers (CACM1970)(T)(4s).djvu
140 Kb
#26
GCD/
1.26 Mb
#27
Grigoriev. Complexity of factoring and GCD of linear differential operators (JSC1990)(L)(T)(16s).djvu
603 Kb
#28
Kaltofen. GCD of polynomials using straight-line programs 1988(43s).ps.gz
119 Kb
#29
Beckermann, Labahn. Euclidean algorithm for numerical polynomial GCD. JSC 1998(T)(24s).djvu
201 Kb
#30
Moses, Yun. The EZ polynomial GCD algorithm(T)(8s).djvu
154 Kb
#31
Sorenson. Analysis of Lehmer's GCD algorithm. ISSAC95(5s).djvu
123 Kb
#32
Weber. Accelerated integer GCD. TOMS 1995(12s).djvu
166 Kb
#33
Moenck. Fast computation of GCDs using Schoenhage (ACM1973)(10s).djvu
124 Kb
#34
Bradley. New Euclidean algorithm for GCD (CACM 1970)(4s).djvu
154 Kb
#35
Brown. Euclid algorithm and polynomial GCD analysis (SIGSAM1971)(17s).djvu
249 Kb
#36
GCD/
1.23 Mb
#37
Bradley. Algorithm 386. GCD of n integers and multipliers (CACM1970)(4s).djvu
132 Kb
#38
Grigoriev. Complexity of factoring and GCD of linear differential operators (JSC1990)(16s).djvu
602 Kb
#39
Kaltofen. GCD of polynomials using straight-line programs 1988.ps.gz
119 Kb
#40
Beckermann, Labahn. Euclidean algorithm for numerical polynomial GCD. JSC 1998(24s).djvu
195 Kb
#41
Moses, Yun. The EZ polynomial GCD algorithm(8s).djvu
150 Kb
#42
Euclidean algorithm in dimension n
Pottier.
Категория:
Papers
,
Numerical methods
,
GCD
69 Kb
#43
integer and polynomial HGCD algorithms
Yap.
Категория:
Papers
,
Numerical methods
,
GCD
104 Kb