• Home
  • Search
  • An algorithm for approximate counting of points on algebraic sets over finite fields
  • Cite Icon6
  • https://doi.org/10.1007/bfb0054889Copy DOI Icon

An algorithm for approximate counting of points on algebraic sets over finite fields

  • Jan 1, 1998
  • Ming -Deh Huang +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We present a randomized algorithm that takes as input a prime number p, and an algebraic set (represented by a system of polynomials) over the finite field Fp, and counts approximately the number of Fp-rational points in the set. For a fixed number of variables, the algorithm runs in random polynomial time with parallel complexity polylogarithmic in the input parameters (number of input polynomials, their maximum degree, and the prime p), using a polynomial number of processors. However, the degree of the polynomial bound on the running time grows sharply with the number of variables. A combinatorial analysis of the algorithm also shows that, when p is sufficiently large, a good approximate count is represented by Np D , where D is the highest possible dimension of an Fp-irreducible subvariety of the input defined over Fp, and N is the number of such distinct subvarieties. In addition, the algorithm computes these two numbers efficiently. It is also applied to obtain an asymptotic lower bound counting result in the case when an algebraic set defined over ℚ is reduced mod p, where p goes to infinity.

Similar Papers
  • Conference Article
  • Citations39

Solving polynomial systems over finite fields

  • Jul 22, 2012
  • Luk Bettale +2
  • Book Chapter
  • Citations69

Absolute primality of polynomials is decidable in random polynomial time in the number of variables

  • Jan 01, 1981
  • Joos Heintz +1
  • Research Article

Deterministic polynomial factoring over finite fields: A uniform approach via [formula omitted]-schemes

  • Feb 25, 2019
  • Journal of Symbolic Computation
  • Zeyu Guo
  • Book Chapter
  • Citations1

On Solving Systems of Diagonal Polynomial Equations Over Finite Fields

  • Jan 01, 2015
  • Gábor Ivanyos +1
  • Book Chapter

Reinterpretation with Adeles and Ideles

  • Jan 01, 2008
  • Anthony W Knapp
  • Research Article
  • Citations13

On the complexity of parallel parsing of general context-free languages

  • Jan 01, 1986
  • Theoretical Computer Science
  • Wojciech Rytter
  • Book Chapter
  • Citations51

Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, AC k , NC k and NC

  • Jan 01, 1990
  • Peter G Clote
  • Conference Article
  • Citations19

Approximate counting, the Lovasz local lemma, and inference in graphical models

  • Jun 19, 2017
  • Ankur Moitra
  • Research Article
  • Citations12

Fast arithmetics in Artin–Schreier towers over finite fields

  • Dec 22, 2011
  • Journal of Symbolic Computation
  • Luca De Feo +1
  • Research Article
  • Citations14

Lower central series of a free associative algebra over the integers and finite fields

  • Sep 28, 2012
  • Journal of Algebra
  • Surya Bhupatiraju +4
  • Research Article
  • Citations2

The Hurwitz curve over a finite field and its Weierstrass points for the morphism of lines

  • Apr 02, 2021
  • Finite Fields and Their Applications
  • Nazar Arakelian +2
  • Research Article
  • Citations112

Constructing Isogenies between Elliptic Curves Over Finite Fields

  • Jan 01, 1999
  • LMS Journal of Computation and Mathematics
  • Steven D Galbraith
  • Conference Article
  • Citations10

Fast arithmetics in artin-schreier towers over finite fields

  • Jul 28, 2009
  • Luca De Feo +1
  • Conference Article
  • Citations4

An O(log N) Parallel Time Exact Hidden-Line Algorithm

  • Jan 01, 1988
  • Eurographics
  • Frank Dévai
  • Conference Article
  • Citations66

The art gallery problem is ∃ ℝ-complete

  • Jun 20, 2018
  • Mikkel Abrahamsen +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.