大葉大學圖書館 |

登入

回首頁

Primality testing in polynomial time...

DietzfelbingerMartin

Primality testing in polynomial time: from randomized algorithms to 'PRIMES is in P'

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
書名/作者:	Primality testing in polynomial time: from randomized algorithms to 'PRIMES is in P'/ Dietzfelbinger,Martin
作者:	DietzfelbingerMartin
出版者:	Berlin : Springer-Verlag, 2004
面頁冊數:	147頁; 23x15公分
標題:	Numbers, Prime
標題:	Polynomials
ISBN:	3540403442(平裝)

Primality testing in polynomial time: from randomized algorithms to 'PRIMES is in P'
DietzfelbingerMartin

Primality testing in polynomial time: from randomized algorithms to 'PRIMES is in P'Dietzfelbinger,Martin - 1st ed - BerlinSpringer-Verlag2004 - 147頁23x15公分 - Lecture Notes in Computer Science3000.

ISBN: 3540403442(平裝)Subjects--Topical Terms:

210501
Numbers, Prime

Primality testing in polynomial time: from randomized algorithms to 'PRIMES is in P'
LDR:00470nam 2200157 450 001 187989
008 100623t2004 de a a 000 0 eng d
020 $a 3540403442(平裝)
035 $a 9422590
040 $b eng $c DYU
041 $a eng
044 $a de
100 $a DietzfelbingerMartin $3 210500
245 1 0 $a Primality testing in polynomial time: from randomized algorithms to 'PRIMES is in P' $c Dietzfelbinger,Martin
250 $a 1st ed
260 $a Berlin $b Springer-Verlag $c 2004
300 $a 147頁 $c 23x15公分
490 $a Lecture Notes in Computer Science $v 3000
650 $a Numbers, Prime $3 210501
650 $a Polynomials $3 210502