Algorithmic number theory : first international symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994 : proceedings
| 000 | 01606camuu2200385 a 4500 | |
| 001 | 000000068400 | |
| 005 | 20091204111531 | |
| 008 | 941018s1994 gw a b 101 0 eng | |
| 010 | ▼a 94238714 | |
| 020 | ▼a 3540586911 (Berlin : alk. paper) | |
| 020 | ▼a 9783540586913 (Berlin : alk. paper) | |
| 020 | ▼a 0387586911 (New York : alk. paper) | |
| 020 | ▼a 9780387586915 (New York : alk. paper) | |
| 035 | ▼a (OCoLC)ocm31410760 | |
| 035 | ▼a (OCoLC)31410760 | |
| 035 | ▼a (KERIS)REF000010713271 | |
| 040 | ▼a DLC ▼c DLC ▼d DLC ▼d 211009 | |
| 050 | 0 0 | ▼a QA241 ▼b .A43 1994 |
| 082 | 0 4 | ▼a 512/.7 ▼2 22 |
| 090 | ▼a 512.7 ▼b A396 ▼c 1 | |
| 111 | 2 | ▼a Algorithmic Number Theory Symposium ▼n (1st : ▼d 1994 : ▼c Ithaca, N.Y.) |
| 245 | 1 0 | ▼a Algorithmic number theory : ▼b first international symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994 : proceedings / ▼c Leonard M. Adleman, Ming-Deh Huang, eds. |
| 246 | 3 0 | ▼a ANTS-I |
| 246 | 3 | ▼a ANTS-1 |
| 260 | ▼a Berlin ; ▼a New York : ▼b Springer , ▼c c1994. | |
| 300 | ▼a ix, 322 p. : ▼b ill. ; ▼c 24 cm. | |
| 490 | 1 | ▼a Lecture notes in computer science , ▼x 0302-9743 ; ▼v 877 |
| 500 | ▼a Proceedings of the first Algorithmic Number Theory Symposium. | |
| 504 | ▼a Includes bibliographical references and index. | |
| 650 | 0 | ▼a Number theory ▼x Data processing ▼v Congresses. |
| 700 | 1 | ▼a Adleman, Leonard M. |
| 700 | 1 | ▼a Huang, Ming-Deh A. |
| 830 | 0 | ▼a Lecture notes in computer science ; ▼v 877. |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 과학도서관/Sci-Info(2층서고)/ | 청구기호 512.7 A396 1 | 등록번호 121019166 | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
목차
On the difficulty of finding reliable witnesses.- Density computations for real quadratic 2-class groups.- Lattice sieving and trial division.- A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields.- Computing rates of growth of division fields on CM Abelian varieties.- Algorithms for CM-Fields.- Schoof's algorithm and isogeny cycles.- Integer points on rational elliptic curves.- Counting the number of points on elliptic curves over finite fields of characteristic greater than three.- Straight-line complexity and integer factorization.- Decomposition of algebraic functions.- A new modular interpolation algorithm for factoring multivariate polynomials.- The function field sieve.- Heegner point computations.- Computing the degree of a modular parametrization.- Galois representations from the cohomology of SL(3,?).- An analysis of the Gaussian algorithm for lattice reduction.- A fast variant of the Gaussian reduction algorithm.- Reducing lattice bases by means of approximations.- Analysis of a left-shift binary GCD algorithm.- The complexity of greatest common divisor computations.- Explicit formulas for units in certain quadratic number fields.- Factorization of polynomials over finite fields in subexponential time under GRH.- On orders of optimal normal basis generators.- Computing in the jacobian of a plane algebraic curve.- Under the assumption of the Generalized Riemann Hypothesis verifying the class number belongs to NP ? co-NP.- Calculating the class number of certain Hilbert class fields.- Efficient checking of computations in number theory.- Constructing elliptic curves with given group order over large finite fields.- Computing ?(x), M(x) and ?(x).- On some applications of finitely generated semi-groups.- Improved incremental prime number sieves.- Polynomial time algorithms for discrete logarithms and factoring on a quantum computer.- On dispersion and Markov constants.- Open problems in number theoretic complexity, II.
정보제공 :
