Counting curves and their projections
From MaRDI portal
Publication:677992
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 429512 (Why is no real title available?)
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 3855273 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1254255 (Why is no real title available?)
- scientific article; zbMATH DE number 1306861 (Why is no real title available?)
- scientific article; zbMATH DE number 1555946 (Why is no real title available?)
- scientific article; zbMATH DE number 3804835 (Why is no real title available?)
- scientific article; zbMATH DE number 4185767 (Why is no real title available?)
- scientific article; zbMATH DE number 3091928 (Why is no real title available?)
- A deterministic test for permutation polynomials
- Approximate formulas for some functions of prime numbers
- Approximating the Number of Zeroes of a GF[2] Polynomial
- Computing Frobenius maps and factoring polynomials
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Explicit zero-free regions for Dirichlet L-functions
- Exponential sums and rational points on complete intersections
- Factoring multivariate polynomials over finite fields
- Factorization of Multivariate Polynomials Over Finite Fields
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast parallel absolute irreducibility testing
- Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
- Matrix multiplication via arithmetic progressions
- Monte-Carlo approximation algorithms for enumeration problems
- New NP-hard and NP-complete polynomial and integer divisibility problems
- On Exponential Sums in Finite Fields
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
- Searching for Primitive Roots in Finite Fields
- Sparse complex polynomials and polynomial reducibility
- Tests for Permutation Polynomials
- Tests for permutation functions
- There are infinitely many Carmichael numbers
- Weil bounds for singular curves
Cited in
(21)- Counting points on smooth plane quartics
- \#P-completeness of counting roots of a sparse polynomial
- On the number of distinct elliptic curves in some families
- scientific article; zbMATH DE number 1555946 (Why is no real title available?)
- Sur le dénombrement des courbes de Fučik
- Computing the multilinear factors of lacunary polynomials without heights
- Projecting syzygies of curves
- VISIBLE POINTS ON EXPONENTIAL CURVES
- Enumeration of Concrete Regular Covering Projections
- Solving polynomial systems over non-fields and applications to modular polynomial factoring
- Fast computation of a rational point of a variety over a finite field
- The number of reducible space curves over a finite field
- Approximating the Number of Zeroes of a GF[2] Polynomial
- Computing zeta functions of large polynomial systems over finite fields
- Algorithms for modular counting of roots of multivariate polynomials
- Quantum algorithms for algebraic problems
- Faster \(p\)-adic feasibility for certain multivariate sparse polynomials
- Order of torsion for reduction of linearly independent points for a family of Drinfeld modules
- Counting curves on the plane blown up in three collinear points
- Sublinear root detection and new hardness results for sparse polynomials over finite fields
- Counting reducible and singular bivariate polynomials
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)
