LEADER 01161nam0-2200349---450 001 990010025410403321 005 20190801105214.0 010 $a978-88-596-1236-0 035 $a001002541 035 $aFED01001002541 035 $a(Aleph)001002541FED01 035 $a001002541 100 $a20151221d2013----km-y0itay50------ba 101 0 $aita 102 $aIT 105 $a--------001yy 200 1 $aPer descrivere il territorio$eagronomi, cartografi, naturalisti, viaggiatori nella Toscana tra 18. e 20. secolo$fa cura di Lucia Bigliazzi ... [et al.] 210 $aFirenze$cPolistampa$d2013 215 $a43 p.$cill.$d22 x 24 cm 300 $aMostra tenuta a Firenze nel 2013 300 $aIn testa al frontespizio: Accademia dei Georgofili 610 0 $aCartografia$aToscana$aSec. 18.-20.$aCataloghi di esposizioni 676 $a912.455$v22$zita 702 1$aBigliazzi,$bLucia 712 02$aAccademia dei Georgofili 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990010025410403321 952 $a60 912.455 BIGL 2013$b031/2015$fFAGBC 959 $aFAGBC 996 $aPer descrivere il territorio$91559012 997 $aUNINA LEADER 05197nam 22007215 450 001 996465944303316 005 20200701235714.0 010 $a3-540-44994-9 024 7 $a10.1007/10722028 035 $a(CKB)1000000000548784 035 $a(SSID)ssj0000321183 035 $a(PQKBManifestationID)11246318 035 $a(PQKBTitleCode)TC0000321183 035 $a(PQKBWorkID)10263024 035 $a(PQKB)11077804 035 $a(DE-He213)978-3-540-44994-2 035 $a(MiAaPQ)EBC3087838 035 $a(PPN)155205056 035 $a(EXLCZ)991000000000548784 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithmic Number Theory$b[electronic resource] $e4th International Symposium, ANTS-IV Leiden, The Netherlands, July 2-7, 2000 Proceedings /$fedited by Wieb Bosma 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (IX, 612 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1838 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-67695-3 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- The Complexity of Some Lattice Problems -- Rational Points Near Curves and Small Nonzero | x 3 ? y 2| via Lattice Reduction -- Coverings of Curves of Genus 2 -- Lattice Reduction in Cryptology: An Update -- Contributed Papers -- Construction of Secure C ab Curves Using Modular Curves -- Curves over Finite Fields with Many Rational Points Obtained by Ray Class Field Extensions -- New Results on Lattice Basis Reduction in Practice -- Baby-Step Giant-Step Algorithms for Non-uniform Distributions -- On Powers as Sums of Two Cubes -- Factoring Polynomials over ?-Adic Fields -- Strategies in Filtering in the Number Field Sieve -- Factoring Polynomials over Finite Fields and Stable Colorings of Tournaments -- Computing Special Values of Partial Zeta Functions -- Construction of Tables of Quartic Number Fields -- Counting Discriminants of Number Fields of Degree up to Four -- On Reconstruction of Algebraic Numbers -- Dissecting a Sieve to Cut Its Need for Space -- Counting Points on Hyperelliptic Curves over Finite Fields -- Modular Forms for GL(3) and Galois Representations -- Modular Symbols and Hecke Operators -- Fast Jacobian Group Arithmetic on C ab Curves -- Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem -- A One Round Protocol for Tripartite Diffie?Hellman -- On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields -- Component Groups of Quotients of J 0(N) -- Fast Computation of Relative Class Numbers of CM-Fields -- On Probable Prime Testing and the Computation of Square Roots mod n -- Improving Group Law Algorithms for Jacobians of Hyperelliptic Curves -- Central Values of Artin L-Functions for Quaternion Fields -- The Pseudoprimes up to 1013 -- Computing the Number of Goldbach Partitions up to 5 108 -- Numerical Verification of the Brumer-Stark Conjecture -- Explicit Models of Genus 2 Curves with Split CM -- Reduction in Purely Cubic Function Fields of Unit Rank One -- Factorization in the Composition Algebras -- A Fast Algorithm for Approximately Counting Smooth Numbers -- Computing All Integer Solutions of a General Elliptic Equation -- A Note on Shanks?s Chains of Primes -- Asymptotically Fast Discrete Logarithms in Quadratic Number Fields -- Asymptotically Fast GCD Computation in ?[i]. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1838 606 $aNumber theory 606 $aData encryption (Computer science) 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aNumber Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/M25001 606 $aCryptology$3https://scigraph.springernature.com/ontologies/product-market-codes/I28020 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aSymbolic and Algebraic Manipulation$3https://scigraph.springernature.com/ontologies/product-market-codes/I17052 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 615 0$aNumber theory. 615 0$aData encryption (Computer science). 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 14$aNumber Theory. 615 24$aCryptology. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aDiscrete Mathematics in Computer Science. 676 $a512/.7 702 $aBosma$b Wieb$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aAlgorithmic Number Theory Symposium$d(4th :$f2000 :$eLeiden, Netherlands) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465944303316 996 $aAlgorithmic Number Theory$9772632 997 $aUNISA