The following pages link to (Q3963114):
Displayed 20 items.
- On the computing time of the continued fractions method (Q438690) (← links)
- The computation of polynomial greatest common divisors over an algebraic number field (Q582076) (← links)
- Complexity of computation on real algebraic numbers (Q757065) (← links)
- Real root isolation for exp-log-arctan functions (Q765861) (← links)
- Computing primitive elements of extension fields (Q911775) (← links)
- Computing partial information out of intractable: powers of algebraic numbers as an example (Q1048926) (← links)
- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation (Q1124635) (← links)
- Detecting cusps and inflection points in curves (Q1195058) (← links)
- Distances from differences of roots of polynomials to the nearest integers (Q1199554) (← links)
- A modular method for computing the Galois groups of polynomials (Q1358933) (← links)
- Cook's versus Valiant's hypothesis (Q1978701) (← links)
- New bounds for the Descartes method (Q2457314) (← links)
- Polynomial root separation examples (Q2457387) (← links)
- A parallel multi-modular algorithm for computing Lagrange resolvents (Q2643525) (← links)
- An inequality for the norm of a polynomial factor (Q2719002) (← links)
- Spécialisation de la suite de Sturm et sous-résultants (I) (Q3358238) (← links)
- Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares (Q3576578) (← links)
- Detecting algebraic curves in bad position (Q5937884) (← links)
- On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture (Q5938580) (← links)
- Polynomial minimum root separation (Q5950981) (← links)