Counting curves and their projections
DOI10.1007/BF01202042zbMATH Open0990.68642MaRDI QIDQ677992FDOQ677992
Marek Karpinski, Igor E. Shparlinski, Joachim von zur Gathen
Publication date: 5 May 1999
Published in: Computational Complexity (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational aspects of algebraic curves (14Q05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Searching for Primitive Roots in Finite Fields
- Exponential sums and rational points on complete intersections
- Matrix multiplication via arithmetic progressions
- There are infinitely many Carmichael numbers
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
- On Exponential Sums in Finite Fields
- Approximate formulas for some functions of prime numbers
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
- Monte-Carlo approximation algorithms for enumeration problems
- Computing Frobenius maps and factoring polynomials
- Factoring multivariate polynomials over finite fields
- New NP-hard and NP-complete polynomial and integer divisibility problems
- A deterministic test for permutation polynomials
- Tests for permutation functions
- Tests for Permutation Polynomials
- Weil bounds for singular curves
- Fast parallel absolute irreducibility testing
- Approximating the Number of Zeroes of a GF[2] Polynomial
- Sparse complex polynomials and polynomial reducibility
- Factorization of Multivariate Polynomials Over Finite Fields
- Explicit zero-free regions for Dirichlet L-functions
Cited In (19)
- Computing zeta functions of large polynomial systems over finite fields
- Counting curves on the plane blown up in three collinear points
- Order of torsion for reduction of linearly independent points for a family of Drinfeld modules
- Computing the multilinear factors of lacunary polynomials without heights
- \#P-completeness of counting roots of a sparse polynomial
- On the number of distinct elliptic curves in some families
- VISIBLE POINTS ON EXPONENTIAL CURVES
- Counting reducible and singular bivariate polynomials
- Algorithms for modular counting of roots of multivariate polynomials
- Fast computation of a rational point of a variety over a finite field
- Approximating the Number of Zeroes of a GF[2] Polynomial
- Projecting syzygies of curves
- Sur le dénombrement des courbes de Fučik
- Faster \(p\)-adic feasibility for certain multivariate sparse polynomials
- Solving polynomial systems over non-fields and applications to modular polynomial factoring
- Title not available (Why is that?)
- Enumeration of Concrete Regular Covering Projections
- Sublinear root detection and new hardness results for sparse polynomials over finite fields
- Quantum algorithms for algebraic problems
Recommendations
This page was built for publication: Counting curves and their projections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q677992)
