| Record ID | marc_loc_updates/v36.i10.records.utf8:15929080:1141 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_updates/v36.i10.records.utf8:15929080:1141?format=raw |
LEADER: 01141cam a22003134a 4500
001 2002038444
003 DLC
005 20080306082217.0
008 021107s2003 sz b 001 0 eng
010 $a 2002038444
016 7 $a965528774$2GyFmDB
020 $a3764366540 (acid-free paper)
020 $a0817666540 (acid-free paper)
035 $a(OCoLC)ocm51022751
040 $aDLC$cDLC$dOHX$dC#P$dBAKER$dDLC
042 $apcc
050 00 $aQA267.7$b.S55 2003
072 7 $aQA$2lcco
082 00 $a512/.73$221
100 1 $aShparlinski, Igor E.
245 10 $aCryptographic applications of analytic number theory :$bcomplexity lower bounds and pseudorandomness /$cIgor Shparlinski.
260 $aBasel ;$aBoston :$bBirkhäuser Verlag,$cc2003.
300 $aviii, 411 p. ;$c24 cm.
440 0 $aProgress in computer science and applied logic ;$vv. 22
504 $aIncludes bibliographical references (p. [367]-407) and index.
650 0 $aComputational complexity.
650 0 $aCoding theory.
650 0 $aCombinatorial number theory.
856 42 $3Publisher description$uhttp://www.loc.gov/catdir/enhancements/fy0812/2002038444-d.html