scientific article; zbMATH DE number 1113820

zbMATH Open0898.11045MaRDI QIDQ4375592FDOQ4375592

Authors: Leonard M. Adleman, Ming-Deh A. Huang 

Publication date: 4 October 1998

Title of this publication is not available (Why is that?)

Recommendations

• Counting points on curves and Abelian varieties over finite fields
• Counting points on curves over finite fields
• Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields

zbMATH Keywords

hyperelliptic curvesJacobian varietiesdeterministic algorithmprimality testrational pointscomplexity analysischaracteristic polynomial of the Frobenius endomorphismabelian variety over a finite field

Mathematics Subject Classification ID

Varieties over finite and local fields (11G25) Rational points (14G05) Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16) Finite ground fields in algebraic geometry (14G15) Computational aspects of algebraic curves (14Q05) Arithmetic ground fields for curves (14H25) Arithmetic ground fields for abelian varieties (14K15) Computational aspects of higher-dimensional varieties (14Q15)

Cited In (18)

• Counting Multiplicities in a Hypersurface over Number Fields
• Computing zeta functions of algebraic curves using Harvey's trace formula
• Title not available (Why is that?)
• Modular counting of rational points over finite fields
• Counting points on curves and Abelian varieties over finite fields
• Counting points on smooth plane quartics
• Counting points on curves over finite fields
• Counting rational points of a Grassmannian
• Progress in Cryptology - INDOCRYPT 2003
• On the number of rational points on an algebraic curve over a finite field
• Algorithms for modular counting of roots of multivariate polynomials
• Approximating Euler products and class number computation in algebraic function fields
• Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology
• Counting hyperelliptic curves on an abelian surface with quasi-modular forms
• A p-Adic Quasi-Quadratic Time Point Counting Algorithm
• The formula \(12=10+2\times 1\) and its generalizations: Counting rational curves on \(F_2\)
• Number fields in fibers: the geometrically abelian case with rational critical values
• Decision problems in quadratic function fields of high genus

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375592)