國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Algorithmic number theory9th Interna...

(1998 :)

Algorithmic number theory9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithmic number theoryedited by Guillaume Hanrot, Francois Morain, Emmanuel Thome.
其他題名:	9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010 : proceedings /
其他作者:	Morain, Francois.
團體作者:
出版者:	Berlin, Heidelberg :Springer-Verlag Berlin Heidelberg,2010.
面頁冊數:	xi, 396 p. :digital ;24 cm.
叢書名:	Lecture notes in computer science,
Contained By:	Springer eBooks
標題:	Number theory
電子資源:	http://dx.doi.org/10.1007/978-3-642-14518-6
ISBN:	9783642145186 (electronic bk.)

Algorithmic number theory9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010 : proceedings /
Algorithmic number theory9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010 : proceedings /[electronic resource] :edited by Guillaume Hanrot, Francois Morain, Emmanuel Thome. - Berlin, Heidelberg :Springer-Verlag Berlin Heidelberg,2010. - xi, 396 p. :digital ;24 cm. - Lecture notes in computer science,61970302-9743 ;.

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

254084
Number theory

LC Class. No.: QA241 / .A44 2010

Dewey Class. No.: 512.7

Algorithmic number theory9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010 : proceedings /
LDR:00919nmm 2200241 a 4500 001 274024
003 Springer
005 20101028103536.0
006 m d
007 cr nn 008maaau
008 101221s2010 gw s j eng d
020 $a 9783642145186 (electronic bk.)
020 $a 9783642145179 (paper)
035 $a 978-3-642-14517-9
050 0 4 $a QA241 $b .A44 2010
082 0 4 $a 512.7 $2 22
090 $a QA241 $b .A396 2010
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Algorithmic number theory $h [electronic resource] : $b 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010 : proceedings / $c edited by Guillaume Hanrot, Francois Morain, Emmanuel Thome.
260 $a Berlin, Heidelberg : $b Springer-Verlag Berlin Heidelberg, $c 2010.
300 $a xi, 396 p. : $b digital ; $c 24 cm.
440 0 $a Lecture notes in computer science, $x 0302-9743 ; $v 6197
650 0 $a Number theory $3 254084
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Data Encryption. $3 273765
650 2 4 $a Symbolic and Algebraic Manipulation. $3 273720
650 2 4 $a Number Theory. $3 274059
650 2 4 $a Algorithms. $3 184661
700 1 $a Morain, Francois. $3 484936
700 1 $a Thome, Emmanuel. $3 484937
700 1 $a Hanrot, Guillaume. $3 484935
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-642-14518-6
950 $a Computer Science (Springer-11645)