Algorithmic Number Theory [[electronic resource] ] : Second International Symposium, ANTS-II, Talence, France, May 18 - 23, 1996, Proceedings / / edited by Henri Cohen |
Edizione | [1st ed. 1996.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
Descrizione fisica | 1 online resource (X, 414 p.) |
Disciplina | 512/.7 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Algebra Algorithms Data encryption (Computer science) Computer science—Mathematics Number theory Theory of Computation Algorithm Analysis and Problem Complexity Cryptology Discrete Mathematics in Computer Science Number Theory |
ISBN | 3-540-70632-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Counting rational points on curves and abelian varieties over finite fields -- Computing cubic fields in quasi-linear time -- Fast ideal arithmetic via lazy localization -- A comparative study of algorithms for computing continued fractions of algebraic numbers -- Computing ray class groups, conductors and discriminants -- Computing l-isogenies using the p-torsion -- On computing Hilbert class fields of prime degree -- On the reduction of composed relations from the number field sieve -- Checking the p-adic stark conjecture when p is archimedean -- A multiple polynomial general number field sieve -- Construction of high-rank elliptic curves over Q and Q(t) with non-trivial 2-torsion -- The height on an abelian variety -- On lattices over number fields -- Minimum discriminants of primitive sextic fields -- A new algorithm and refined bounds for extended gcd computation -- Application of thue equations to computing power integral bases in algebraic number fields -- Computing S-integral points on elliptic curves -- Probabilistic computation of the Smith normal form of a sparse integer matrix -- Ray class field constructions of curves over finite fields with many rational points -- Computing isogenies in F2n -- A computational technique for determining relative class numbers of CM-fields -- Old and new deterministic factoring algorithms -- Efficient algorithms for computing the Jacobi symbol -- The number field database on the World Wide web server http://hasse.mathematik.tu-muenchen.de/ -- An algorithm of subexponential type computing the class group of quadratic orders over principal ideal domains -- Computational aspects of Kummer theory -- On integral basis reduction in global function fields -- Computational aspects of curves of genus at least 2 -- The complexity of approximate optima for greatest common divisor computations -- Compact representation in real quadratic congruence function fields -- Discrete logarithms: The effectiveness of the index calculus method -- How difficult is it to solve a thue equation? -- Elliptic congruence function fields -- Algebraic geometry lattices and codes -- Computing discrete logarithms with the general number field sieve. |
Record Nr. | UNISA-996465629503316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Handbook of categorization in cognitive science / / edited by Henri Cohen, Université du Québec à Montréal, Canada, Claire Lefebvre, Université du Québec à Montréal, Canada |
Edizione | [Second edition.] |
Pubbl/distr/stampa | Amsterdam : , : Elsevier, , [2017] |
Descrizione fisica | 1 online resource (1,263 pages) : illustrations |
Disciplina | 160 |
Soggetto topico |
Categorization (Psychology)
Cognitive science |
ISBN | 0-12-809766-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910583067203321 |
Amsterdam : , : Elsevier, , [2017] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|