東華大學圖書館 |

語系: 繁體中文

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Primality testing in polynomial time...

SpringerLink (Online service)

FindBook

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. :digital ;24 cm.
Contained By:	Springer e-books
標題:	Algorithms. -
電子資源:	http://dx.doi.org/10.1007/b12334
ISBN:	9783540403449 (paper)

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. :digital ;24 cm. - LNCS,3000.0302-9743 ;. - Lecture notes in computer science ;3000..

ISBN: 9783540403449 (paper)Subjects--Topical Terms:

536374
Algorithms.

LC Class. No.: QA246 / .D54 2004

Dewey Class. No.: 512.942

Primality testing in polynomial time = from randomized algorithms to "primes" is in P /
LDR:00774nam 2200229 a 45 001 843993
003 GreenPo
005 20100602
006 m d
007 cr nn 008maaau
008 100602s2004 gw j eng d
020 $a 9783540403449 (paper)
035 $a 978-3-540-40344-9
050 0 0 $a QA246 $b .D54 2004
082 0 0 $a 512.942 $2 22
100 1 $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. : $b digital ; $c 24 cm.
490 1 $a LNCS, $x 0302-9743 ; $v 3000. $a Tutorial
650 0 $a Algorithms. $3 536374
650 0 $a Numbers, Prime. $3 521084
650 0 $a Polynomials. $3 604754
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer e-books
830 0 $a Lecture notes in computer science ; $v 3000. $3 845560
830 0 $a Lecture notes in computer science. $p Tutorial. $3 770709
856 4 0 $u http://dx.doi.org/10.1007/b12334
950 $a Computer Science (Lecture Notes in Computer Science)