多項式作輾轉相除法所需次數的估計
dc.contributor | 許志農 | zh_TW |
dc.contributor | Hsu, Chin-Nung | en_US |
dc.contributor.author | 郭家瑋 | zh_TW |
dc.contributor.author | Guo, Jia-Wei | en_US |
dc.date.accessioned | 2019-09-05T01:11:31Z | |
dc.date.available | 2006-7-6 | |
dc.date.available | 2019-09-05T01:11:31Z | |
dc.date.issued | 2006 | |
dc.description.abstract | 任給定一有限體上次數大於1的多項式M,此篇文章主要是估計:所有次數小於M,與M互質的多項式a,跟M做輾轉相除法所需的平均次數。 | zh_TW |
dc.description.abstract | Let 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.identifier | GN0692400119 | |
dc.identifier.uri | http://etds.lib.ntnu.edu.tw/cgi-bin/gs32/gsweb.cgi?o=dstdcdr&s=id=%22GN0692400119%22.&%22.id.& | |
dc.identifier.uri | http://rportal.lib.ntnu.edu.tw:80/handle/20.500.12235/101714 | |
dc.language | 英文 | |
dc.subject | 輾轉相除法 | zh_TW |
dc.subject | 有限體 | zh_TW |
dc.subject | Euclidean Algorithm | en_US |
dc.subject | finite fields | en_US |
dc.title | 多項式作輾轉相除法所需次數的估計 | zh_TW |
dc.title | The Number of Steps in the Polynomial Euclidean Algorithm | en_US |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- n069240011901.pdf
- Size:
- 249.69 KB
- Format:
- Adobe Portable Document Format