Algorithmic Number Theory (Record no. 36717)

000 -LEADER
fixed length control field 04824nam a22005775i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540706328
-- 978-3-540-70632-8
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
245 10 - TITLE STATEMENT
Title Algorithmic Number Theory
Sub Title Second International Symposium, ANTS-II Talence, France, May 18–23, 1996 Proceedings /
Statement of responsibility, etc edited by Henri Cohen.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 1996.
300 ## - PHYSICAL DESCRIPTION
Number of Pages X, 414 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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 $$\mathfrak{p}$$ -adic stark conjecture when $$\mathfrak{p}$$ is archimedean -- A multiple polynomial general number field sieve -- Construction of high-rank elliptic curves over ? and ?(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 $$\mathbb{F}_{2^n } $$ -- 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.
520 ## - SUMMARY, ETC.
Summary, etc This book constitutes the refereed post-conference proceedings of the Second International Algorithmic Number Theory Symposium, ANTS-II, held in Talence, France in May 1996. The 35 revised full papers included in the book were selected from a variety of submissions. They cover a broad spectrum of topics and report state-of-the-art research results in computational number theory and complexity theory. Among the issues addressed are number fields computation, Abelian varieties, factoring algorithms, finite fields, elliptic curves, algorithm complexity, lattice theory, and coding.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Data encryption (Computer science).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer software.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computational complexity.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Geometry, algebraic.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Number theory.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Data Encryption.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Number Theory.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithms.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algebraic Geometry.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Cohen, Henri.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/3-540-61581-4
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 1996.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK7423 http://dx.doi.org/10.1007/3-540-61581-4 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha