Pages that link to "Item:Q677992"

The following pages link to Counting curves and their projections (Q677992):

Displaying 20 items.

• Faster \(p\)-adic feasibility for certain multivariate sparse polynomials (Q412210) (← links)
• On the number of distinct elliptic curves in some families (Q849356) (← links)
• Counting reducible and singular bivariate polynomials (Q958607) (← links)
• Counting curves on the plane blown up in three collinear points (Q1041268) (← links)
• \#P-completeness of counting roots of a sparse polynomial (Q1628696) (← links)
• The number of reducible space curves over a finite field (Q1938580) (← links)
• Order of torsion for reduction of linearly independent points for a family of Drinfeld modules (Q2064326) (← links)
• Counting points on smooth plane quartics (Q2100591) (← links)
• Computing zeta functions of large polynomial systems over finite fields (Q2171948) (← links)
• Computing the multilinear factors of lacunary polynomials without heights (Q2229711) (← links)
• Algorithms for modular counting of roots of multivariate polynomials (Q2482732) (← links)
• Sublinear root detection and new hardness results for sparse polynomials over finite fields (Q2816831) (← links)
• Quantum algorithms for algebraic problems (Q3077033) (← links)
• Fast computation of a rational point of a variety over a finite field (Q3420246) (← links)
• Approximating the Number of Zeroes of a GF[2] Polynomial (Q4033769) (← links)
• Sur le dénombrement des courbes de Fučik (Q4260063) (← links)
• VISIBLE POINTS ON EXPONENTIAL CURVES (Q4642341) (← links)
• Enumeration of Concrete Regular Covering Projections (Q4764343) (← links)
• Projecting syzygies of curves (Q5126743) (← links)
• Solving polynomial systems over non-fields and applications to modular polynomial factoring (Q6543078) (← links)