Pages that link to "Item:Q2658549"

The following pages link to On the complexity exponent of polynomial system solving (Q2658549):

Displaying 23 items.

• A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
• Condition length and complexity for the solution of polynomial systems (Q506608) (← links)
• Solving systems of polynomial inequalities over a real closed field in subexponential time (Q804242) (← links)
• Message length effects for solving polynomial systems on a hypercube (Q1121641) (← links)
• The complexity of deciding consistency of systems of polynomials in exponent inequalities (Q1190747) (← links)
• Solvability of systems of polynomial congruences modulo a large prime (Q1590076) (← links)
• On the bit complexity of polynomial system solving (Q1734694) (← links)
• An improvement of the complexity bound for solving systems of polynomial equations (Q1762547) (← links)
• Amortized multi-point evaluation of multivariate polynomials (Q2099269) (← links)
• Computing Riemann-Roch spaces via Puiseux expansions (Q2171940) (← links)
• Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases (Q2204858) (← links)
• Fast amortized multi-point evaluation (Q2238846) (← links)
• A concise proof of the Kronecker polynomial system solver from scratch (Q2427141) (← links)
• On the computation of rational solutions of underdetermined systems over a finite field (Q2685068) (← links)
• (Q3421275) (← links)
• (Q3485804) (← links)
• (Q4232499) (← links)
• (Q4761611) (← links)
• Segre-driven radicality testing (Q6184180) (← links)
• Interpolation by decomposable univariate polynomials (Q6614422) (← links)
• Bivariate polynomial reduction and elimination ideal over finite fields (Q6615408) (← links)
• Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities (Q6631548) (← links)
• Amortized bivariate multi-point evaluation (Q6666534) (← links)