Strong version of the basic deciding algorithm for the existential theory of real fields

DOI10.1023/A:1012481809783zbMath0980.14034OpenAlexW2276311089MaRDI QIDQ5948014

Alexander L. Chistov

Publication date: 30 October 2001

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1012481809783

zbMATH Keywords

real algebraic varietyalgorithm of polynomial complexitynon-empty intersection with every cycle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability and field theory (12L05) Real algebraic sets (14P05) Computational aspects of higher-dimensional varieties (14Q15) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Real and complex fields (12D99)

Related Items (5)

Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero) ⋮ A deterministic polynomial-time algorithm for the first Bertini theorem. II ⋮ A deterministic polynomial-time algorithm for the first Bertini theorem. I ⋮ A deterministic polynomial-time algorithm for the first Bertini theorem. III ⋮ Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV.

This page was built for publication: Strong version of the basic deciding algorithm for the existential theory of real fields