scientific article
From MaRDI portal
Publication:3697106
zbMath0576.12001MaRDI QIDQ3697106
No author found.
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items (35)
Model checking QCTL plus on quantum Markov chains ⋮ Fast parallel absolute irreducibility testing ⋮ Primitive recursive ordered fields and some applications ⋮ The determinant of an elliptic sylvesteresque matrix ⋮ An improved projection operation for cylindrical algebraic decomposition of three-dimensional space ⋮ A cluster-based cylindrical algebraic decomposition algorithm ⋮ Résolution du problème de l'ellipse et du cercle par l'algorithme de Hörmander ⋮ Positive root isolation for poly-powers by exclusion and differentiation ⋮ The Diophantine problem for systems of algebraic equations with exponents ⋮ Analyzing ultimate positivity for solvable systems ⋮ Almost periodic sequences. ⋮ Computing primitive elements of extension fields ⋮ Geometric reasoning with logic and algebra ⋮ A singly exponential stratification scheme for real semi-algebraic varieties and its applications ⋮ Fast computation of special resultants ⋮ Determination of the tangents for a real plane algebraic curve ⋮ Computation of unirational fields ⋮ Partial cylindrical algebraic decomposition for quantifier elimination ⋮ A weak version of the Blum, Shub, and Smale model ⋮ Polynomial computability of fields of algebraic numbers ⋮ Univariate real root isolation in an extension field and applications ⋮ Detecting algebraic curves in bad position ⋮ On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture ⋮ On weak and weighted computations over the real closure of \(\mathbb{Q}\) ⋮ The computation of polynomial greatest common divisors over an algebraic number field ⋮ Exact, efficient, and complete arrangement computation for cubic curves ⋮ Nonhydrostatic two-layer models of incompressible flow ⋮ A conflict-driven solving procedure for poly-power constraints ⋮ Computing the irreducible real factors and components of an algebraic curve ⋮ Generic computation of the real closure of an ordered field. ⋮ A Polynomial Time Complexity Bound for Computations on Curves ⋮ Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision ⋮ Fields of algebraic numbers computable in polynomial time. I ⋮ Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey ⋮ Algorithmic detection and description of hyperbolic structures on closed 3-manifolds with solvable word problem
This page was built for publication:
