Pages that link to "Item:Q3420246"
From MaRDI portal
The following pages link to Fast computation of a rational point of a variety over a finite field (Q3420246):
Displaying 10 items.
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
- Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus (Q2303419) (← links)
- Degeneracy loci and polynomial equation solving (Q2340506) (← links)
- On the computation of rational points of a hypersurface over a finite field (Q2360665) (← links)
- Improved complexity bounds for counting points on hyperelliptic curves (Q2420634) (← links)
- A concise proof of the Kronecker polynomial system solver from scratch (Q2427141) (← links)
- Change of order for regular chains in positive dimension (Q2476011) (← links)
- Improved explicit estimates on the number of solutions of equations over a finite field (Q2490135) (← links)
- On the computation of rational solutions of underdetermined systems over a finite field (Q2685068) (← links)
