東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Primality testing in polynomial time...

NetLibrary, Inc.

FindBook

Google Book

Amazon

博客來

Primality testing in polynomial time = from randomized algorithms to "primes is in P" /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Primality testing in polynomial time/ Martin Dietzfelbinger.
其他題名:	from randomized algorithms to "primes is in P" /
作者:	Dietzfelbinger, Martin.
出版者:	Berlin ;Springer, : c2004.,
面頁冊數:	x, 147 p. ;24 cm.
標題:	Algorithms. -
電子資源:	http://www.netLibrary.com/urlapi.asp?action=summary&v=1&bookid=133732An electronic book accessible through the World Wide Web; click for information
ISBN:	3540259333 (electronic bk.)

Primality testing in polynomial time = from randomized algorithms to "primes is in P" /
Dietzfelbinger, Martin.

Primality testing in polynomial timefrom randomized algorithms to "primes is in P" /[electronic resource] :Martin Dietzfelbinger. - 1st ed. - Berlin ;Springer,c2004. - x, 147 p. ;24 cm. - LNCS,3000.0302-9743 ;. - Lecture notes in computer science ;3000..

Includes bibliographical references (p. [143]-144) and index.

Electronic reproduction.
Boulder, Colo. :
NetLibrary,
2005.

Available via World Wide Web.

ISBN: 3540259333 (electronic bk.)Subjects--Topical Terms:

536374
Algorithms.
Index Terms--Genre/Form:

542853
Electronic books.

LC Class. No.: QA246 / .D54 2004eb

Dewey Class. No.: 512.9/42

Primality testing in polynomial time = from randomized algorithms to "primes is in P" /
LDR:01159nam a2200277 a 45 001 740954
003 OCoLC
005 20080429
006 m d
007 cr cnu---unuuu
008 080429s2004 gw sb 001 0 eng d
020 $a 3540259333 (electronic bk.)
035 $a ocm61104229
040 $a N $c N
049 $a AMFA
050 1 4 $a QA246 $b .D54 2004eb
082 0 4 $a 512.9/42 $2 22
100 $a Dietzfelbinger, Martin. $3 845559
245 1 0 $a Primality testing in polynomial time $h [electronic resource] : $b from randomized algorithms to "primes is in P" / $c Martin Dietzfelbinger.
250 $a 1st ed.
260 $a Berlin ; $a New York : $c c2004. $b Springer,
300 $a x, 147 p. ; $c 24 cm.
490 1 $a LNCS, $x 0302-9743 ; $v 3000. $a Tutorial
504 $a Includes bibliographical references (p. [143]-144) and index.
530 $a Also issued online.
533 $a Electronic reproduction. $b Boulder, Colo. : $c NetLibrary, $d 2005. $n Available via World Wide Web. $n Access may be limited to NetLibrary affiliated libraries.
650 $a Algorithms. $3 536374
650 $a Numbers, Prime. $3 521084
650 $a Polynomials. $3 604754
655 $a Electronic books. $2 lcsh $3 542853
710 $a NetLibrary, Inc. $3 542851
830 $a Lecture notes in computer science ; $v 3000. $3 845560
830 $a Lecture notes in computer science. $p Tutorial. $3 770709
856 4 0 $3 Bibliographic record display $u http://www.netLibrary.com/urlapi.asp?action=summary&v=1&bookid=133732 $z An electronic book accessible through the World Wide Web; click for information
994 $a 92 $b AMF