|
|
|
|
LEADER |
01356nmm a2200373 u 4500 |
001 |
EB000287675 |
003 |
EBX01000000000000000053359 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
101003 ||| |
020 |
|
|
|a 9783540454557
|
020 |
|
|
|a 978-3-540-43863-2
|
100 |
1 |
|
|a Fieker, Claus
|
245 |
0 |
0 |
|a Algorithmic Number Theory
|h Elektronische Ressource
|b 5th International Symposium, ANTS-V Sydney, Australia, July 7–12, 2002 Proceedings
|c edited by Claus Fieker, David R Kohel
|
260 |
|
|
|a Berlin, Heidelberg
|b Springer-Verlag Berlin Heidelberg
|c 2002
|
300 |
|
|
|b v. digital
|
700 |
1 |
|
|a Kohel, David R
|
989 |
|
|
|b LNCS
|a Lecture Notes in Computer Science
|
490 |
0 |
|
|a Lecture Notes in Computer Science
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/3-540-45455-1?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 004
|
650 |
|
4 |
|a Algorithms
|
650 |
|
4 |
|a Computational complexity
|
650 |
|
4 |
|a Computer software
|
650 |
|
4 |
|a Data encryption (Computer science)
|
650 |
|
4 |
|a Electronic data processing
|
650 |
|
4 |
|a Field theory (Physics)
|
650 |
|
4 |
|a Computer Science
|
650 |
|
4 |
|a Algorithm Analysis and Problem Complexity
|
650 |
|
4 |
|a Algorithms
|
650 |
|
4 |
|a Data Encryption
|
650 |
|
4 |
|a Discrete Mathematics in Computer Science
|
650 |
|
4 |
|a Field Theory and Polynomials
|
650 |
|
4 |
|a Numeric Computing
|