|
|
|
|
| LEADER |
01812nom a2200445 u 4500 |
| 001 |
10090568 |
| 003 |
upatras |
| 005 |
20210423112301.0 |
| 008 |
110802s2010 eng |
| 020 |
|
|
|a 9783642145186
|
| 040 |
|
|
|a GR-PaULI
|c GR-PaULI
|
| 041 |
0 |
|
|a eng
|
| 100 |
1 |
|
|a Hanrot, Guillaume
|9 94171
|
| 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, FranΓois Morain, Emmanuel ThomΓ©
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer-Verlag Berlin Heidelberg
|c 2010
|
| 300 |
|
|
|b v.: digital
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|v 6197
|x 0302-9743
|
| 650 |
|
4 |
|a Computer science
|9 13995
|
| 650 |
|
4 |
|a Data encryption (Computer science)
|9 64602
|
| 650 |
|
4 |
|a Computer software
|9 24488
|
| 650 |
|
4 |
|a Computational complexity
|9 20484
|
| 650 |
|
4 |
|a Algebra
|x Data processing
|9 66998
|
| 650 |
|
4 |
|a Algorithms
|9 12256
|
| 650 |
|
4 |
|a Number theory
|9 64709
|
| 650 |
|
4 |
|a Computer Science
|9 64565
|
| 650 |
|
4 |
|a Algorithm Analysis and Problem Complexity
|9 64576
|
| 650 |
|
4 |
|a Discrete Mathematics in Computer Science
|9 64594
|
| 650 |
|
4 |
|a Data Encryption
|9 64604
|
| 650 |
|
4 |
|a Άλγεβρα
|x Ηλεκτρονικοί υπολογιστές
|x Προγράμματα
|9 112864
|
| 650 |
|
4 |
|a Number Theory
|9 64710
|
| 650 |
|
4 |
|a Algorithms
|9 12256
|
| 700 |
1 |
|
|a Morain, FranΓois
|9 94172
|
| 700 |
1 |
|
|a ThomΓ©, Emmanuel
|9 94173
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|9 68735
|
| 760 |
1 |
|
|a Lecture notes in computer science
|g 6197
|x 0302-9743
|
| 852 |
|
|
|a GR-PaULI
|b ΠΑΤΡΑ
|b ΒΚΠ
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-14518-6
|
| 942 |
|
|
|2 ddc
|
| 952 |
|
|
|0 0
|1 0
|4 0
|7 0
|9 98482
|a LISP
|b LISP
|d 2016-04-24
|l 0
|r 2016-04-24 00:00:00
|w 2016-04-24
|y ERS
|
| 999 |
|
|
|c 66268
|d 66268
|
