Advanced analytic number theory . Part 1 Ramification theoretic methods / / Carlos J. Moreno |
Autore | Moreno Carlos J. |
Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , [1983] |
Descrizione fisica | 1 online resource (202 p.) |
Disciplina | 512/.7 |
Collana | Contemporary mathematics |
Soggetto topico |
Number theory
Algebraic fields |
ISBN | 0-8218-7601-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
""Contents""; ""Preface""; ""Chapter 0. Introduction""; ""Â1. A historical perspective""; ""Â2. The explicit formulas: motivation""; ""Chapter I. Galois Theory for Infinite Extensions""; ""Â1. Fundamental Theorem of Galois Theory for infinite extensions""; ""Â2. Topological properties of Gal(K'/K)""; ""Â3. Example""; ""Chapter II. Projective Limits""; ""Â1. Basic definitions""; ""Â2. Examples""; ""Â3. Homomorphisms""; ""Chapter III. Elementary Theory of l-adic Integration""; ""Â1. Distributions and measures""; ""Â2. Measures on groups""; ""Â3. Riemann sums""
""Â4. l-adic Haar measures""""Â5. Examples""; ""Chapter IV. Ramification Theory""; ""Â1. The v-function""; ""Â2. Transitivity properties of the v-function""; ""Â3. The different""; ""Â4. Transitivity properties of the different""; ""Â5. Complementary basis""; ""Â6. Fundamental inequality and the C-invariant""; ""Â7. Quotients of Galois groups and Herbrand's Theorem""; ""Chapter V. Multiplicative versus Additive Reduction""; ""Â1. The case of a local field""; ""Â2. The module structure of the unit group""; ""Â3. The case of an elliptic curve"" ""Chapter VI. Ramification of Abelian Extensions""""Â1. Index computations""; ""Â2. Main Theorem""; ""Chapter VII. The Weil Groups of a Local Field""; ""Â1. The Frobenius automorphism""; ""Â2. The relative Weil group of a non-archimedean local field""; ""Â3. The absolute Weil group""; ""Â4. The Weil group of an archimedean local field""; ""Â5. The Weil-Deligne group""; ""Appendix: The non-abelian local reciprocity law""; ""Chapter VIII. Shafarevitch's Theorem""; ""Â1. Representations of a simple algebra""; ""Â2. Factor sets""; ""Â3. Subalgebras of central simple algebras"" ""Â4. Cyclic algebras""""Â5. Algebras and group extensions""; ""Â6. Powers of central simple algebras""; ""Â7. Generators of the Brauer group""; ""Â8. Structure of the relative Weil group""; ""Â9. Shafarevitch's Theorem""; ""Appendix: I. The Brauer group of central 'simple algebras over K""; ""II. The group H2(G,Kxs)""; ""Chapter IX. The Herbrand Distribution""; ""Â1. The Herbrand distribution: definition and basic facts""; ""Â2. The support of the Herbrand distribution""; ""Â3. Determination of the Herbrand distribution on Gal(Kab/K)"" ""Â4. Functoriality properties of the Herbrand distribution""""Â5. The Herbrand distribution and measures on the Weil group""; ""Â6. The integral formula for the Herbrand distribution""; ""Â7. Conductors, the Artin representation, and the Herbrand distribution""; ""Bibliography""; ""Index""; ""C""; ""D""; ""E""; ""F""; ""G""; ""H""; ""I""; ""L""; ""M""; ""P""; ""R""; ""S""; ""T""; ""w"" |
Record Nr. | UNINA-9910788780103321 |
Moreno Carlos J.
![]() |
||
Providence, Rhode Island : , : American Mathematical Society, , [1983] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Advanced analytic number theory . Part 1 Ramification theoretic methods / / Carlos J. Moreno |
Autore | Moreno Carlos J. |
Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , [1983] |
Descrizione fisica | 1 online resource (202 p.) |
Disciplina | 512/.7 |
Collana | Contemporary mathematics |
Soggetto topico |
Number theory
Algebraic fields |
ISBN | 0-8218-7601-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
""Contents""; ""Preface""; ""Chapter 0. Introduction""; ""Â1. A historical perspective""; ""Â2. The explicit formulas: motivation""; ""Chapter I. Galois Theory for Infinite Extensions""; ""Â1. Fundamental Theorem of Galois Theory for infinite extensions""; ""Â2. Topological properties of Gal(K'/K)""; ""Â3. Example""; ""Chapter II. Projective Limits""; ""Â1. Basic definitions""; ""Â2. Examples""; ""Â3. Homomorphisms""; ""Chapter III. Elementary Theory of l-adic Integration""; ""Â1. Distributions and measures""; ""Â2. Measures on groups""; ""Â3. Riemann sums""
""Â4. l-adic Haar measures""""Â5. Examples""; ""Chapter IV. Ramification Theory""; ""Â1. The v-function""; ""Â2. Transitivity properties of the v-function""; ""Â3. The different""; ""Â4. Transitivity properties of the different""; ""Â5. Complementary basis""; ""Â6. Fundamental inequality and the C-invariant""; ""Â7. Quotients of Galois groups and Herbrand's Theorem""; ""Chapter V. Multiplicative versus Additive Reduction""; ""Â1. The case of a local field""; ""Â2. The module structure of the unit group""; ""Â3. The case of an elliptic curve"" ""Chapter VI. Ramification of Abelian Extensions""""Â1. Index computations""; ""Â2. Main Theorem""; ""Chapter VII. The Weil Groups of a Local Field""; ""Â1. The Frobenius automorphism""; ""Â2. The relative Weil group of a non-archimedean local field""; ""Â3. The absolute Weil group""; ""Â4. The Weil group of an archimedean local field""; ""Â5. The Weil-Deligne group""; ""Appendix: The non-abelian local reciprocity law""; ""Chapter VIII. Shafarevitch's Theorem""; ""Â1. Representations of a simple algebra""; ""Â2. Factor sets""; ""Â3. Subalgebras of central simple algebras"" ""Â4. Cyclic algebras""""Â5. Algebras and group extensions""; ""Â6. Powers of central simple algebras""; ""Â7. Generators of the Brauer group""; ""Â8. Structure of the relative Weil group""; ""Â9. Shafarevitch's Theorem""; ""Appendix: I. The Brauer group of central 'simple algebras over K""; ""II. The group H2(G,Kxs)""; ""Chapter IX. The Herbrand Distribution""; ""Â1. The Herbrand distribution: definition and basic facts""; ""Â2. The support of the Herbrand distribution""; ""Â3. Determination of the Herbrand distribution on Gal(Kab/K)"" ""Â4. Functoriality properties of the Herbrand distribution""""Â5. The Herbrand distribution and measures on the Weil group""; ""Â6. The integral formula for the Herbrand distribution""; ""Â7. Conductors, the Artin representation, and the Herbrand distribution""; ""Bibliography""; ""Index""; ""C""; ""D""; ""E""; ""F""; ""G""; ""H""; ""I""; ""L""; ""M""; ""P""; ""R""; ""S""; ""T""; ""w"" |
Record Nr. | UNINA-9910811765303321 |
Moreno Carlos J.
![]() |
||
Providence, Rhode Island : , : American Mathematical Society, , [1983] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithmic Number Theory [[electronic resource] ] : 4th International Symposium, ANTS-IV Leiden, The Netherlands, July 2-7, 2000 Proceedings / / edited by Wieb Bosma |
Edizione | [1st ed. 2000.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
Descrizione fisica | 1 online resource (IX, 612 p.) |
Disciplina | 512/.7 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Number theory
Data encryption (Computer science) Algorithms Computer science—Mathematics Number Theory Cryptology Algorithm Analysis and Problem Complexity Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science |
ISBN | 3-540-44994-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited 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]. |
Record Nr. | UNISA-996465944303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithmic Number Theory : 4th International Symposium, ANTS-IV Leiden, The Netherlands, July 2-7, 2000 Proceedings / / edited by Wieb Bosma |
Edizione | [1st ed. 2000.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
Descrizione fisica | 1 online resource (IX, 612 p.) |
Disciplina | 512/.7 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Number theory
Data encryption (Computer science) Algorithms Computer science—Mathematics Number Theory Cryptology Algorithm Analysis and Problem Complexity Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science |
ISBN | 3-540-44994-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited 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]. |
Record Nr. | UNINA-9910768443603321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithmic Number Theory [[electronic resource] ] : Third International Symposium, ANTS-III, Portland, Orgeon, USA, June 21-25, 1998, Proceedings / / edited by Joe P. Buhler |
Edizione | [1st ed. 1998.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
Descrizione fisica | 1 online resource (X, 646 p.) |
Disciplina | 512/.7 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Number theory Computer science—Mathematics Algorithms Data encryption (Computer science) Theory of Computation Number Theory Symbolic and Algebraic Manipulation Algorithm Analysis and Problem Complexity Cryptology |
ISBN | 3-540-69113-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Shimura curve computations -- The Decision Diffie-Hellman problem -- Parallel implementation of Schönhage's integer GCD algorithm -- The complete analysis of the binary Euclidean algorithm -- Cyclotomy primality proving — Recent developments -- Primality proving using elliptic curves: An update -- Bounding smooth integers (extended abstract) -- Factorization of the numbers of the form m 3 + c 2 m 2 + c 1 m + c 0 -- Modelling the yield of number field sieve polynomials -- A Montgomery-like square root for the Number Field Sieve -- Robert Bennion's “hopping sieve” -- Trading time for space in prime number sieves -- Do sums of 4 biquadrates have a positive density? -- New experimental results concerning the Goldbach conjecture -- Dense admissible sets -- An analytic approach to smooth polynomials over finite fields -- Generating a product of three primes with an unknown factorization -- On the performance of signature schemes based on elliptic curves -- NTRU: A ring-based public key cryptosystem -- Finding length-3 positive Cunningham chains and their cryptographic significance -- Reducing ideal arithmetic to linear algebra problems -- Evaluation of linear relations between vectors of a lattice in euclidean space -- An efficient parallel block-reduction algorithm -- Fast multiprecision evaluation of series of rational numbers -- A problem concerning a character sum -- Formal power series and their continued fraction expansion -- Imprimitive octic fields with small discriminants -- A table of totally complex number fields of small discriminants -- Generating arithmetically equivalent number fields with elliptic curves -- Computing the lead term of an abelian L-function -- Timing analysis of targeted hunter searches -- On successive minima of rings of algebraic integers -- Computation of relative quadratic class groups -- Generating class fields using Shimura reciprocity -- Irregularity of prime numbers over real quadratic fields -- Experimental results on class groups of real quadratic fields -- Computation of relative class numbers of imaginary cyclic fields of 2-power degrees -- Formal groups, elliptic curves, and some theorems of Couveignes -- A comparison of direct and indirect methods for computing Selmer groups of an elliptic curve -- An algorithm for approximate counting of points on algebraic sets over finite fields -- S-integral points on elliptic curves and Fermat's triple equations -- Speeding up Pollard's rho method for computing discrete logarithms -- A general method of constructing global function fields with many rational places -- Lattice basis reduction in function fields -- Comparing real and imaginary arithmetics for divisor class groups of hyperelliptic curves -- Unit computation in purely cubic function fields of unit rank 1 -- An improved method of computing the regulator of a real quadratic function field -- The equivalence between elliptic curve and quadratic function field discrete logarithms in characteristic 2. |
Record Nr. | UNISA-996466157603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithmic Number Theory [[electronic resource] ] : Third International Symposium, ANTS-III, Portland, Orgeon, USA, June 21-25, 1998, Proceedings / / edited by Joe P. Buhler |
Edizione | [1st ed. 1998.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
Descrizione fisica | 1 online resource (X, 646 p.) |
Disciplina | 512/.7 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Number theory Computer science—Mathematics Algorithms Data encryption (Computer science) Theory of Computation Number Theory Symbolic and Algebraic Manipulation Algorithm Analysis and Problem Complexity Cryptology |
ISBN | 3-540-69113-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Shimura curve computations -- The Decision Diffie-Hellman problem -- Parallel implementation of Schönhage's integer GCD algorithm -- The complete analysis of the binary Euclidean algorithm -- Cyclotomy primality proving — Recent developments -- Primality proving using elliptic curves: An update -- Bounding smooth integers (extended abstract) -- Factorization of the numbers of the form m 3 + c 2 m 2 + c 1 m + c 0 -- Modelling the yield of number field sieve polynomials -- A Montgomery-like square root for the Number Field Sieve -- Robert Bennion's “hopping sieve” -- Trading time for space in prime number sieves -- Do sums of 4 biquadrates have a positive density? -- New experimental results concerning the Goldbach conjecture -- Dense admissible sets -- An analytic approach to smooth polynomials over finite fields -- Generating a product of three primes with an unknown factorization -- On the performance of signature schemes based on elliptic curves -- NTRU: A ring-based public key cryptosystem -- Finding length-3 positive Cunningham chains and their cryptographic significance -- Reducing ideal arithmetic to linear algebra problems -- Evaluation of linear relations between vectors of a lattice in euclidean space -- An efficient parallel block-reduction algorithm -- Fast multiprecision evaluation of series of rational numbers -- A problem concerning a character sum -- Formal power series and their continued fraction expansion -- Imprimitive octic fields with small discriminants -- A table of totally complex number fields of small discriminants -- Generating arithmetically equivalent number fields with elliptic curves -- Computing the lead term of an abelian L-function -- Timing analysis of targeted hunter searches -- On successive minima of rings of algebraic integers -- Computation of relative quadratic class groups -- Generating class fields using Shimura reciprocity -- Irregularity of prime numbers over real quadratic fields -- Experimental results on class groups of real quadratic fields -- Computation of relative class numbers of imaginary cyclic fields of 2-power degrees -- Formal groups, elliptic curves, and some theorems of Couveignes -- A comparison of direct and indirect methods for computing Selmer groups of an elliptic curve -- An algorithm for approximate counting of points on algebraic sets over finite fields -- S-integral points on elliptic curves and Fermat's triple equations -- Speeding up Pollard's rho method for computing discrete logarithms -- A general method of constructing global function fields with many rational places -- Lattice basis reduction in function fields -- Comparing real and imaginary arithmetics for divisor class groups of hyperelliptic curves -- Unit computation in purely cubic function fields of unit rank 1 -- An improved method of computing the regulator of a real quadratic function field -- The equivalence between elliptic curve and quadratic function field discrete logarithms in characteristic 2. |
Record Nr. | UNINA-9910143504203321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
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 | ||
|
Algorithmic Number Theory [[electronic resource] ] : First International Symposium, ANTS-I, Ithaca, NY, USA, May 6 - 9, 1994. Proceedings / / edited by Leonard M. Adleman, Ming-Deh Huang |
Edizione | [1st ed. 1994.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
Descrizione fisica | 1 online resource (X, 320 p.) |
Disciplina | 512/.7 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Data structures (Computer science)
Number theory Discrete mathematics Computer science—Mathematics Algorithms Combinatorics Data Structures Number Theory Discrete Mathematics Symbolic and Algebraic Manipulation Algorithm Analysis and Problem Complexity |
ISBN | 3-540-49044-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 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. |
Record Nr. | UNISA-996466151203316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Ant Algorithms [[electronic resource] ] : Third International Workshop, ANTS 2002, Brussels, Belgium, September 12-14, 2002. Proceedings / / edited by Marco Dorigo, Gianni Di Caro, Michael Sampels |
Edizione | [1st ed. 2002.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Descrizione fisica | 1 online resource (XIV, 310 p.) |
Disciplina | 512/.7 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer communication systems
Artificial intelligence Computer programming Algorithms Computers Numerical analysis Computer Communication Networks Artificial Intelligence Programming Techniques Algorithm Analysis and Problem Complexity Computation by Abstract Devices Numeric Computing |
ISBN | 3-540-45724-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | A MAX-MIN Ant System for the University Course Timetabling Problem -- A MAX-MIN Ant System for the University Course Timetabling Problem -- ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification -- ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification -- Agent-Based Approach to Dynamic Task Allocation -- Agent-Based Approach to Dynamic Task Allocation -- An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem -- An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem -- An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows -- An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows -- Ant Algorithms for Assembly Line Balancing -- Ant Algorithms for Assembly Line Balancing -- Ant Colonies as Logistic Processes Optimizers -- Ant Colonies as Logistic Processes Optimizers -- Ant Systems for a Dynamic TSP -- Ant Systems for a Dynamic TSP -- Anti-pheromone as a Tool for Better Exploration of Search Space -- Anti-pheromone as a Tool for Better Exploration of Search Space -- Applying Population Based ACO to Dynamic Optimization Problems -- Applying Population Based ACO to Dynamic Optimization Problems -- Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks -- Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks -- Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows -- Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows -- Modelling ACO: Composed Permutation Problems -- Modelling ACO: Composed Permutation Problems -- Self-Organized Networks of Galleries in the Ant Messor Sancta -- Self-Organized Networks of Galleries in the Ant Messor Sancta -- Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic -- Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic -- Toward the Formal Foundation of Ant Programming -- Toward the Formal Foundation of Ant Programming -- Towards Building Terrain-Covering Ant Robots -- Towards Building Terrain-Covering Ant Robots -- Short Papers -- A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions -- An Ant-Based Framework for Very Strongly Constrained Problems -- Analysis of the Best-Worst Ant System and Its Variants on the QAP -- Ants and Loops -- Candidate Set Strategies for Ant Colony Optimisation -- Dynamic Wavelength Routing in WDM Networks via Ant Colony Optimization -- Homogeneous Ants for Web Document Similarity Modeling and Categorization -- Parallel Ant System for the Set Covering Problem -- Real-World Shop Floor Scheduling by Ant Colony Optimization -- Simulation of Nest Assessment Behavior by Ant Scouts -- Using Genetic Algorithms to Optimize ACS-TSP -- Posters -- A Method for Solving Optimization Problems in Continuous Space Using Ant Colony Algorithm -- A Nested Layered Threshold Model for Dynamic Task Allocation -- ACO Algorithm with Additional Reinforcement -- Ant Colony System for Image Segmentation Using Markov Random Field -- Bidimensional Shapes Polygonalization by ACO -- Coevolutionary Ant Algorithms Playing Games -- GAACO: A GA + ACO Hybrid for Faster and Better Search Capability -- GPS Positioning Networks Design: An Application of the Ant Colony System. |
Record Nr. | UNISA-996465516903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Ant Algorithms : Third International Workshop, ANTS 2002, Brussels, Belgium, September 12-14, 2002. Proceedings / / edited by Marco Dorigo, Gianni Di Caro, Michael Sampels |
Edizione | [1st ed. 2002.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Descrizione fisica | 1 online resource (XIV, 310 p.) |
Disciplina | 512/.7 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer networks
Artificial intelligence Computer programming Algorithms Computers Numerical analysis Computer Communication Networks Artificial Intelligence Programming Techniques Algorithm Analysis and Problem Complexity Computation by Abstract Devices Numeric Computing |
ISBN | 3-540-45724-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | A MAX-MIN Ant System for the University Course Timetabling Problem -- A MAX-MIN Ant System for the University Course Timetabling Problem -- ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification -- ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification -- Agent-Based Approach to Dynamic Task Allocation -- Agent-Based Approach to Dynamic Task Allocation -- An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem -- An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem -- An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows -- An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows -- Ant Algorithms for Assembly Line Balancing -- Ant Algorithms for Assembly Line Balancing -- Ant Colonies as Logistic Processes Optimizers -- Ant Colonies as Logistic Processes Optimizers -- Ant Systems for a Dynamic TSP -- Ant Systems for a Dynamic TSP -- Anti-pheromone as a Tool for Better Exploration of Search Space -- Anti-pheromone as a Tool for Better Exploration of Search Space -- Applying Population Based ACO to Dynamic Optimization Problems -- Applying Population Based ACO to Dynamic Optimization Problems -- Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks -- Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks -- Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows -- Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows -- Modelling ACO: Composed Permutation Problems -- Modelling ACO: Composed Permutation Problems -- Self-Organized Networks of Galleries in the Ant Messor Sancta -- Self-Organized Networks of Galleries in the Ant Messor Sancta -- Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic -- Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic -- Toward the Formal Foundation of Ant Programming -- Toward the Formal Foundation of Ant Programming -- Towards Building Terrain-Covering Ant Robots -- Towards Building Terrain-Covering Ant Robots -- Short Papers -- A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions -- An Ant-Based Framework for Very Strongly Constrained Problems -- Analysis of the Best-Worst Ant System and Its Variants on the QAP -- Ants and Loops -- Candidate Set Strategies for Ant Colony Optimisation -- Dynamic Wavelength Routing in WDM Networks via Ant Colony Optimization -- Homogeneous Ants for Web Document Similarity Modeling and Categorization -- Parallel Ant System for the Set Covering Problem -- Real-World Shop Floor Scheduling by Ant Colony Optimization -- Simulation of Nest Assessment Behavior by Ant Scouts -- Using Genetic Algorithms to Optimize ACS-TSP -- Posters -- A Method for Solving Optimization Problems in Continuous Space Using Ant Colony Algorithm -- A Nested Layered Threshold Model for Dynamic Task Allocation -- ACO Algorithm with Additional Reinforcement -- Ant Colony System for Image Segmentation Using Markov Random Field -- Bidimensional Shapes Polygonalization by ACO -- Coevolutionary Ant Algorithms Playing Games -- GAACO: A GA + ACO Hybrid for Faster and Better Search Capability -- GPS Positioning Networks Design: An Application of the Ant Colony System. |
Record Nr. | UNINA-9910143893103321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|