POLYNOMIAL-TIME REDUCTIONS FROM MULTIVARIATE TO BI BIVARIATE AND UNIVARIATE INTEGRAL POLYNOMIAL FACTORIZATION

被引:80
作者
KALTOFEN, E [1 ]
机构
[1] RENSSELAER POLYTECH INST,DEPT MATH SCI,TROY,NY 12181
关键词
D O I
10.1137/0214035
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:469 / 489
页数:21
相关论文
共 35 条
[1]  
[Anonymous], 1976, SYMSAC 76
[2]   EUCLIDS ALGORITHM AND COMPUTATION OF POLYNOMIAL GREATEST COMMON DIVISORS [J].
BROWN, WS .
JOURNAL OF THE ACM, 1971, 18 (04) :478-&
[3]   EUCLIDS ALGORITHM AND THEORY OF SUBRESULTANTS [J].
BROWN, WS ;
TRAUB, JF .
JOURNAL OF THE ACM, 1971, 18 (04) :505-&
[4]  
CHISTOV AL, 1982, E582 LOM PREPR
[5]   On Hilberts irreducible proposition [J].
Dorge, K .
MATHEMATISCHE ANNALEN, 1926, 95 :84-97
[6]   Testings on the Hilbert irreducibility principle. [J].
Franz, W .
MATHEMATISCHE ZEITSCHRIFT, 1931, 33 :275-293
[7]  
Gantmacher F. R., 1959, MATRIX THEORY, V1
[8]  
GELFAND AO, 1960, TRANSCENDENTAL ALGEB
[9]  
Hilbert David, 1892, J REINE ANGEW MATH, V110, P104, DOI [10.1515/crll.1892.110.104, DOI 10.1515/CRLL.1892.110.104]
[10]  
Kaltofen E., 1982, 23rd Annual Symposium on Foundations of Computer Science, P57, DOI 10.1109/SFCS.1982.56