Record ID | harvard_bibliographic_metadata/ab.bib.10.20150123.full.mrc:552695197:1871 |
Source | harvard_bibliographic_metadata |
Download Link | /show-records/harvard_bibliographic_metadata/ab.bib.10.20150123.full.mrc:552695197:1871?format=raw |
LEADER: 01871cam a2200361 a 4500
001 010734310-X
005 20070913125213.0
008 041103s2005 enk f b 001 0 eng
010 $a 2006530670
015 $aGBA506738$2bnb
016 7 $a013092522$2Uk
020 $a0521851548 (cased)
020 $a9780521851541 (cased)
020 $a0521617251 (pbk.)
020 $a9780521617253 (pbk.)
035 0 $aocm57527998
040 $aUKM$cUKM$dC#P$dBAKER$dNLGGC$dDLC$dMUQ$dYBM$dYDXCP$dOCLCQ$dBTCTA
050 00 $aQA241$b.S465 2005
082 04 $a004.0151$222
100 1 $aShoup, Victor.
245 12 $aA computational introduction to number theory and algebra /$cVictor Shoup.
260 $aCambridge ;$aNew York :$bCambridge University Press,$c2005.
300 $axvi, 517 p. ;$c26 cm.
504 $aIncludes bibliographical references (p. 504-509) and indexes.
505 0 $aBasic properties of the integers -- Congruences -- Computing with large integers -- Euclid's algorithm -- The distribution of primes -- Finite and discrete probability distributions -- Probabilistic algorithms -- Abelian groups -- Rings -- Probabilistic primality testing -- Finding generators and discrete logarithms in Z*p -- Quadratic residues and quadratic reciprocity -- Computational problems related to quadratic residues -- Modules and vector spaces -- Matrices -- Subexponential-time discrete logarithms and factoring -- More rings -- Polynomial arithmetic and applications -- Linearly generated sequences and applications -- Finite fields -- Algorithms for finite fields -- Deterministic primality testing.
650 0 $aComputer science$xMathematics.
650 0 $aNumber theory.
650 17 $aNumerieke wiskunde.$2gtt
650 17 $aAlgoritmen.$2gtt
650 17 $aGeheimschrift.$2gtt
650 6 $aNombres, Théorie des$xInformatique.
988 $a20070802
906 $0OCLC