- 1、本文档共17页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Fast parallel absolute irreducibility testing
Fast Parallel Absolute Irreducibility Testing
*
U
Erich Kaltofen
niversity of Toronto
e
T
Department of Computer Scienc
oronto, Ontario M5S1A4, Canada
W
Abstract
e present a fast parallel deterministic algorithm for testing multivariate integral polyno-
-
c
mials for absolute irreducibility, that is irreducibility over the complex numbers. More pre
isely, we establish that the set of absolutely irreducible integral polynomials belongs to the
e
i
complexity class NC of Boolean circuits of polynomial size and logarithmic depth. Therefor
t also belongs to the class of sequentially polynomial-time problems. Our algorithm can be
-
n
extended to compute in parallel one irreducible complex factor of a multivariate integral poly
omial. However, the coefficients of the computed factor are only represented modulo a not
r
necessarily irreducible polynomial specifying a splitting field. A consequence of our algo-
ithm is that multivariate polynomials over finite fields can be tested for absolute irreducibility
p
b
in deterministic sequential polynomial time in the size of the input. We also obtain a shar
ound for the last prime p for which, when taking an absolutely irreducible integral polyno-
f
o
mial modulo p , the polynomial’s irreducibility in the algebraic closure of the finite field o
rder p is not preserved.
Keywords: Absolute Irreducibility, Polynomial-Time Complexity, Parallel Algorithm.
*
hhhhhhhhhhhhhhh
This research was partially supported by the National Science and Engineering Council of Canada under grant
A
3-643-126-90.
uthor’s current address: Rensselaer Polytechnic Institute, Department of Computer Science, Troy, New York,
T
12181.
his paper appears in the Journal of Symbolic Computation, vol. 1, nr. 1, pp. 57-67 (1985).
1- 2 -
. Introduction
-
t
The determination of the irreducibility of a polynomial with coefficients in a unique fac
orization domain is an old problem. Recently, several new algorithms for univariate and
e
f
multivariate factorization over va
您可能关注的文档
- Dynamic assessment of the value of vegetation carbon fixation and oxygen release Qinghai Lake basin.pdf
- Dynamic quantum theory of large additional dimensions for non-massive particles.pdf
- Dynamic prediction of collection yield for managed runtimes.pdf
- Dynamic response and reliability analysis of tall buildings subject to wind loading.pdf
- Dynamical interplay between local connectivity and global competition in a networked popula.pdf
- Dynamic ruptures in recent models of earthquake faults.pdf
- Dynamical systems method for solving operator equations.pdf
- Dynamics of concentrated polymer systems. Part 2.—Molecular motion under flow.pdf
- E-bay Case Study.pdf
- EAP3_EWAN_Selfish_Gene.pdf
文档评论(0)