|
|
|
|
LEADER |
01295nam a2200421 4500 |
001 |
DLU110121486 |
005 |
##20110519 |
008 |
##021107s2003 sz b 001 0 eng |
010 |
# |
# |
|a 2002038444
|
016 |
# |
# |
|a 965528774
|2 GyFmDB
|
020 |
# |
# |
|a 0817666540 (acid-free paper)
|
020 |
# |
# |
|a 3764366540 (acid-free paper)
|
035 |
# |
# |
|a (OCoLC)ocm51022751
|
040 |
# |
# |
|a DLC
|c DLC
|d OHX
|d C#P
|d BAKER
|d DLC
|
042 |
# |
# |
|a pcc
|
072 |
# |
# |
|a QA
|2 lcco
|
082 |
# |
# |
|a 512.73
|b SH-I
|
100 |
# |
# |
|a Shparlinski, Igor E.
|
245 |
# |
# |
|a Cryptographic applications of analytic number theory :
|b complexity lower bounds and pseudorandomness.
|n t.XVII /
|c Igor Shparlinski.
|
260 |
# |
# |
|a Basel ;
|a Boston :
|b Birkhäuser Verlag,
|c c2003.
|
300 |
# |
# |
|a viii, 411 p. ;
|c 21x30 cm.
|
440 |
# |
# |
|a Progress in computer science and applied logic ;
|v v. 22
|
504 |
# |
# |
|a Includes bibliographical references (p. [367]-407) and index.
|
650 |
# |
# |
|a Coding theory.
|
650 |
# |
# |
|a Combinatorial number theory.
|
650 |
# |
# |
|a Computational complexity.
|
923 |
# |
# |
|a 01/2011TN
|
990 |
# |
# |
|a t.XVII
|
991 |
# |
# |
|a GT
|
992 |
# |
# |
|a 0
|
994 |
# |
# |
|a KTN
|
900 |
# |
# |
|a True
|
911 |
# |
# |
|a Đào Thị Thu Huyền
|
925 |
# |
# |
|a G
|
926 |
# |
# |
|a A
|
927 |
# |
# |
|a SH
|
980 |
# |
# |
|a Thư viện Trường Đại học Đà Lạt
|