The following pages link to (Q3697106):
Displaying 35 items.
- The computation of polynomial greatest common divisors over an algebraic number field (Q582076) (← links)
- A weak version of the Blum, Shub, and Smale model (Q676432) (← links)
- Fields of algebraic numbers computable in polynomial time. I (Q784464) (← links)
- Primitive recursive ordered fields and some applications (Q831997) (← links)
- Analyzing ultimate positivity for solvable systems (Q897909) (← links)
- Computing primitive elements of extension fields (Q911775) (← links)
- Geometric reasoning with logic and algebra (Q918227) (← links)
- Fast parallel absolute irreducibility testing (Q1080657) (← links)
- An improved projection operation for cylindrical algebraic decomposition of three-dimensional space (Q1105370) (← links)
- A cluster-based cylindrical algebraic decomposition algorithm (Q1105372) (← links)
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933) (← links)
- Partial cylindrical algebraic decomposition for quantifier elimination (Q1186711) (← links)
- Almost periodic sequences. (Q1401389) (← links)
- Generic computation of the real closure of an ordered field. (Q1565819) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- The determinant of an elliptic sylvesteresque matrix (Q1639737) (← links)
- Univariate real root isolation in an extension field and applications (Q1757003) (← links)
- Nonhydrostatic two-layer models of incompressible flow (Q1805438) (← links)
- Computing the irreducible real factors and components of an algebraic curve (Q1814128) (← links)
- Algorithmic detection and description of hyperbolic structures on closed 3-manifolds with solvable word problem (Q1865105) (← links)
- Polynomial computability of fields of algebraic numbers (Q1994088) (← links)
- Model checking QCTL plus on quantum Markov chains (Q2123051) (← links)
- A conflict-driven solving procedure for poly-power constraints (Q2303230) (← links)
- Positive root isolation for poly-powers by exclusion and differentiation (Q2409014) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- Determination of the tangents for a real plane algebraic curve (Q2457373) (← links)
- Computation of unirational fields (Q2457397) (← links)
- Exact, efficient, and complete arrangement computation for cubic curves (Q2507159) (← links)
- Résolution du problème de l'ellipse et du cercle par l'algorithme de Hörmander (Q3479523) (← links)
- A Polynomial Time Complexity Bound for Computations on Curves (Q4210172) (← links)
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision (Q4995607) (← links)
- Detecting algebraic curves in bad position (Q5937884) (← links)
- On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture (Q5938580) (← links)
- On weak and weighted computations over the real closure of \(\mathbb{Q}\) (Q5941734) (← links)
- The Diophantine problem for systems of algebraic equations with exponents (Q6054794) (← links)
