My Wish Lists Login / Join

Lecture Notes in Computer Science

First International Symposium, ANTS-I, Ithaca, NY, USA, May 6 - 9, 1994. Proceedings

By: Leonard M. Adleman (Editor), Ming-Deh Huang (Editor)

Write A Review

Paperback | 15 November 1994

At a Glance

Paperback
344 Pages

Dimensions(cm)
24.13 x 16.51 x 2.54

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

This volume presents the refereed proceedings of the First Algorithmic Number Theory Symposium, ANTS-I, held at Cornell University, Ithaca, NY in May 1994.
The 35 papers accepted for inclusion in this book address many current issues of algorithmic, computational and complexity-theoretic aspects of number theory and thus report the state-of-the-art in this exciting area of research; the book also contributes essentially to foundational research in cryptology and coding.
Of particular value is a collection entitled "Open Problems in Number Theoretic Complexity, II" contributed by Len Adleman and Kevin McCurley. This survey presents on 32 pages 36 central open problems and relates them to the literature by means of some 160 references.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

On the difficulty of finding reliable witnesses	p. 1
Density computations for real quadratic 2-class groups	p. 17
Lattice sieving and trial division	p. 18
A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields	p. 28
Computing rates of growth of division fields on CM abelian varieties	p. 41
Algorithms for CM-fields	p. 42
Schoof's algorithm and isogeny cycles	p. 43
Integer points on rational elliptic curves	p. 59
Counting the number of points on elliptic curves over finite fields of characteristic greater than three	p. 60
Straight-line complexity and integer factorization	p. 71
Decomposition of algebraic functions	p. 80
A new modular interpolation algorithm for factoring multivariate polynomials	p. 93
The function field sieve	p. 108
Heegner point computations	p. 122
Computing the degree of a modular parametrization	p. 134
Galois representations from the cohomology of SL(3, Z)	p. 143
An analysis of the Gaussian algorithm for lattice reduction	p. 144
A fast variant of the Gaussian reduction algorithm	p. 159
Reducing lattice bases by means of approximations	p. 160
Analysis of a left-shift binary GCD algorithm	p. 169
The complexity of greatest common divisor computations	p. 184
Explicit formulas for units in certain quadratic number fields	p. 194
Factorization of polynomials over finite fields in subexponential time under GRH	p. 209
On orders of optimal normal basis generators	p. 220
Computing in the jacobian of a plane algebraic curve	p. 221
Under the assumption of the generalized Riemann Hypothesis verifying the class number belongs to [actual symbol not reproducible]	p. 234
Calculating the class number of certain Hilbert class fields	p. 248
Efficient checking of computations in number theory	p. 249
Constructing elliptic curves with given group order over large finite fields	p. 250
Computing [pi](x), M(x) and [Psi](x)	p. 264
On some applications of finitely generated semi-groups	p. 265
Improved incremental prime number sieves	p. 280
Polynomial time algorithms for discrete logarithms and factoring on a quantum computer	p. 289
On dispersion and Markov constants	p. 290
Open problems in number theoretic complexity, II	p. 291
Author Index	p. 323
Table of Contents provided by Blackwell. All Rights Reserved.

Lecture Notes in Computer Science

First International Symposium, ANTS-I, Ithaca, NY, USA, May 6 - 9, 1994. Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Algorithms & Data Structures

Artificial Intelligence for Art Creation and Understanding

Multimedia Computing, Communication and Intelligence

Machine Learning: Code First

An Experiment-First Guide for Programmers

The Man Who Solved the Market

How Jim Simons Launched the Quant Revolution SHORTLISTED FOR THE FT & MCKINSEY BUSINESS BOOK OF THE YEAR AWARD 2019

Algorithms in C, Parts 1-4

3rd Edition - Fundamentals, Data Structures, Sorting, Searching

The Delicate Art of Brute Force

How to Compute It When You Can't Solve It

Code Dependent

Living in the Shadow of AI - Shortlisted for the Women's Prize for Non-Fiction

Introduction to Machine Learning with Python

A Guide for Data Scientists

Learning Algorithms

A Programmer's Guide to Writing Better Code

Python for Algorithmic Trading

From Idea to Cloud Deployment

Decentralized Futures

Navigating the Integration of Blockchain Technology with Artificial Intelligence

Quantum Searching and Optimization Algorithms

A Comprehensive Guide

Python Using GPT-5 and Gemini

Finite Element Mesh Generation, 2e

Fundamentals of Data Structures and Algorithms

Fundamentals of Data Structures and Algorithms

Recursion

Mathematics and Python

Hacker's Delight

Considerations on the AI Endgame

Ethics, Risks and Computational Frameworks

Quick Data Structures

Quick Programming

Artificial Intelligence Programming with Python: From Zero to Hero

From Zero to Hero

Quantum Machine Learning

Theory, Algorithms, and Practical Implementation

The Algorithmic Society

Technology, Power, and Knowledge

Head First Algorithms and Data Structures

A Learner's Guide to the Foundations of Computing

Ciphers, Fractals, and Fibonacci

Exploring Math with Python

This product is categorised by