FACTORING SPARSE MULTIVARIATE POLYNOMIALS

被引:38
作者
GATHEN, JV [1 ]
KALTOFEN, E [1 ]
机构
[1] RENSSELAER POLYTECH INST, DEPT COMP SCI, TROY, NY 12181 USA
关键词
D O I
10.1016/0022-0000(85)90044-3
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:265 / 287
页数:23
相关论文
共 29 条
[1]  
BERLEKAM.ER, 1967, AT&T TECH J, V46, P1853
[2]   FACTORING POLYNOMIALS OVER LARGE FINITE FIELDS [J].
BERLEKAMP, ER .
MATHEMATICS OF COMPUTATION, 1970, 24 (111) :713-+
[3]   FAST PARALLEL MATRIX AND GCD COMPUTATIONS [J].
BORODIN, A ;
GATHEN, JV ;
HOPCROFT, J .
INFORMATION AND CONTROL, 1982, 52 (03) :241-256
[4]  
CHISTOV AL, 1982, LOMI E582 PREPR
[5]  
FICH F, 1985, 17TH P ANN ACM S THE, P38
[6]   PARALLEL ALGORITHMS FOR ALGEBRAIC PROBLEMS [J].
GATHEN, JV .
SIAM JOURNAL ON COMPUTING, 1984, 13 (04) :802-824
[7]  
GATHEN JV, 1984, MATH COMPUT, V42, P637, DOI 10.1090/S0025-5718-1984-0736459-9
[8]  
Gelfond A. O., 1960, TRANSCENDENTAL NUMBE
[9]  
Kaltofen E., 1982, 23rd Annual Symposium on Foundations of Computer Science, P57, DOI 10.1109/SFCS.1982.56
[10]   POLYNOMIAL-TIME REDUCTIONS FROM MULTIVARIATE TO BI BIVARIATE AND UNIVARIATE INTEGRAL POLYNOMIAL FACTORIZATION [J].
KALTOFEN, E .
SIAM JOURNAL ON COMPUTING, 1985, 14 (02) :469-489