000 01713nom a2200433 u 4500
001 10090568
003 upatras
005 20210423112301.0
008 110802s2010 eng
020 _a9783642145186
040 _aGR-PaULI
_cGR-PaULI
041 0 _aeng
100 1 _aHanrot, Guillaume
_994171
245 1 0 _aAlgorithmic Number Theory
_h[electronic resource]
_b9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010. Proceedings
_cedited by Guillaume Hanrot, FranΓois Morain, Emmanuel ThomΓ©
260 _aBerlin, Heidelberg
_bSpringer-Verlag Berlin Heidelberg
_c2010
300 _bv.: digital
490 0 _aLecture Notes in Computer Science
_v6197
_x0302-9743
650 4 _aComputer science
_913995
650 4 _aData encryption (Computer science)
_964602
650 4 _aComputer software
_924488
650 4 _aComputational complexity
_920484
650 4 _aAlgebra
_xData processing
_966998
650 4 _aAlgorithms
_912256
650 4 _aNumber theory
_964709
650 4 _aComputer Science
_964565
650 4 _aAlgorithm Analysis and Problem Complexity
_964576
650 4 _aDiscrete Mathematics in Computer Science
_964594
650 4 _aData Encryption
_964604
650 4 _aΆλγεβρα
_xΗλεκτρονικοί υπολογιστές
_xΠρογράμματα
_9112864
650 4 _aNumber Theory
_964710
650 4 _aAlgorithms
_912256
700 1 _aMorain, FranΓois
_994172
700 1 _aThomΓ©, Emmanuel
_994173
710 2 _aSpringerLink (Online service)
_968735
760 1 _aLecture notes in computer science
_g6197
_x0302-9743
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-14518-6
942 _2ddc
999 _c66268
_d66268