多項式作輾轉相除法所需次數的估計

dc.contributor許志農zh_TW
dc.contributorHsu, Chin-Nungen_US
dc.contributor.author郭家瑋zh_TW
dc.contributor.authorGuo, Jia-Weien_US
dc.date.accessioned2019-09-05T01:11:31Z
dc.date.available2006-7-6
dc.date.available2019-09-05T01:11:31Z
dc.date.issued2006
dc.description.abstract任給定一有限體上次數大於1的多項式M,此篇文章主要是估計:所有次數小於M,與M互質的多項式a,跟M做輾轉相除法所需的平均次數。zh_TW
dc.description.abstractLet M be a monic polynomial over some finite fields. For polynomials a with deg a<deg M and (a,M)=1, we estimate the average value of the Euclidean Algorithm.en_US
dc.description.sponsorship數學系zh_TW
dc.identifierGN0692400119
dc.identifier.urihttp://etds.lib.ntnu.edu.tw/cgi-bin/gs32/gsweb.cgi?o=dstdcdr&s=id=%22GN0692400119%22.&%22.id.&amp;
dc.identifier.urihttp://rportal.lib.ntnu.edu.tw:80/handle/20.500.12235/101714
dc.language英文
dc.subject輾轉相除法zh_TW
dc.subject有限體zh_TW
dc.subjectEuclidean Algorithmen_US
dc.subjectfinite fieldsen_US
dc.title多項式作輾轉相除法所需次數的估計zh_TW
dc.titleThe Number of Steps in the Polynomial Euclidean Algorithmen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
n069240011901.pdf
Size:
249.69 KB
Format:
Adobe Portable Document Format

Collections