|
|
|
|
| LEADER |
02589nam a22005775i 4500 |
| 001 |
11002 |
| 003 |
DE-He213 |
| 005 |
20130725200824.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100708s2010 gw | s |||| 0|eng d |
| 020 |
# |
# |
|a 9783642145186
|9 978-3-642-14518-6
|
| 024 |
7 |
# |
|a 10.1007/978-3-642-14518-6
|2 doi
|
| 050 |
# |
4 |
|a QA76.9.A43
|
| 072 |
# |
7 |
|a UMB
|2 bicssc
|
| 072 |
# |
7 |
|a COM051300
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1
|2 23
|
| 100 |
1 |
# |
|a Hanrot, Guillaume.
|e editor.
|
| 245 |
1 |
0 |
|a Algorithmic Number Theory
|b 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010. Proceedings /
|c edited by Guillaume Hanrot, Franȯis Morain, Emmanuel Thom.̌
|h [electronic resource] :
|
| 264 |
# |
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2010.
|
| 300 |
# |
# |
|a XI, 397p.
|b online resource.
|
| 336 |
# |
# |
|a text
|b txt
|2 rdacontent
|
| 337 |
# |
# |
|a computer
|b c
|2 rdamedia
|
| 338 |
# |
# |
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
# |
# |
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
# |
|a Lecture Notes in Computer Science,
|v 6197
|x 0302-9743 ;
|
| 520 |
# |
# |
|a This book constitutes the refereed proceedings of the 9th International Algorithmic Number Theory Symposium, ANTS 2010, held in Nancy, France, in July 2010. The 25 revised full papers presented together with 5 invited papers were carefully reviewed and selected for inclusion in the book. The papers are devoted to algorithmic aspects of number theory, including elementary number theory, algebraic number theory, analytic number theory, geometry of numbers, algebraic geometry, finite fields, and cryptography.
|
| 650 |
# |
0 |
|a Computer science.
|
| 650 |
# |
0 |
|a Data encryption (Computer science).
|
| 650 |
# |
0 |
|a Computer software.
|
| 650 |
# |
0 |
|a Computational complexity.
|
| 650 |
# |
0 |
|a Algebra
|x Data processing.
|
| 650 |
# |
0 |
|a Algorithms.
|
| 650 |
# |
0 |
|a Number theory.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Data Encryption.
|
| 650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
| 650 |
2 |
4 |
|a Number Theory.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 700 |
1 |
# |
|a Morain, Franȯis.
|e editor.
|
| 700 |
1 |
# |
|a Thom,̌ Emmanuel.
|e editor.
|
| 710 |
2 |
# |
|a SpringerLink (Online service)
|
| 773 |
0 |
# |
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642145179
|
| 830 |
# |
0 |
|a Lecture Notes in Computer Science,
|v 6197
|x 0302-9743 ;
|
| 856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-14518-6
|
| 912 |
# |
# |
|a ZDB-2-SCS
|
| 912 |
# |
# |
|a ZDB-2-LNC
|
| 950 |
# |
# |
|a Computer Science (Springer-11645)
|