Existential theory of the reals
In mathematical logic, computational complexity theory, and computer science, the existential theory of the reals is the set of all true sentences of the form

where the variables  are interpreted as having real number values, and where  is a quantifier-free formula involving equalities and inequalities of real polynomials. A sentence of this form is true if it is possible to find values for all of the variables that, when substituted into formula , make it become true. The decision problem for the existential theory of the reals is the problem of finding an algorithm that decides, for each such sentence, whether it is true or false. Equivalently, it is the problem of testing whether a given semialgebraic set is non-empty. This decision problem is NP-hard and lies in PSPACE, giving it significantly lower complexity than Alfred Tarski's quantifier elimination procedure for deciding statements in the first-order theory of the reals without the restriction to existential quantifiers. However, in practice, general methods for the first-order theory remain the preferred choice for solving these problems. The complexity class  has been defined to describe the class of computational problems that may be translated into equivalent sentences of this form. In structural complexity theory, it lies between NP and PSPACE. Many natural problems in geometric graph theory, especially problems of recognizing geometric intersection graphs and straightening the edges of graph drawings with crossings, belong to , and are complete for this class. Here, completeness means that there exists a translation in the reverse direction, from an arbitrary sentence over the reals into an equivalent instance of the given problem. Background
In mathematical logic, a theory is a formal language consisting of a set of sentences written using a fixed set of symbols. The first-order theory of real closed fields has the following symbols:
the constants 0 and 1,
a countable collection of variables ,
the addition, subtraction, multiplication, and (optionally) division operations,
symbols <, ≤, =, ≥, >, and ≠ for comparisons of real values,
the logical connectives ∧, ∨, ¬, and ⇔,
parentheses, and
the universal quantifier ∀ and the existential quantifier ∃
A sequence of these symbols forms a sentence that belongs to the first-order theory of the reals if it is grammatically well formed, all its variables are properly quantified, and (when interpreted as a mathematical statement about the real numbers) it is a true statement. As Tarski showed, this theory can be described by an axiom schema and a decision procedure that is complete and effective: for every fully quantified and grammatical sentence, either the sentence or its negation (but not both) can be derived from the axioms. The same theory describes every real closed field, not just the real numbers. However, there are other number systems that are not accurately described by these axioms; in particular, the theory defined in the same way for integers instead of real numbers is undecidable, even for existential sentences (Diophantine equations) by Matiyasevich's theorem. The existential theory of the reals is the fragment of the first-order theory consisting of sentences in which all the quantifiers are existential and they appear before any of the other symbols. That is, it is the set of all true sentences of the form

where  is a quantifier-free formula involving equalities and inequalities of real polynomials. The decision problem for the existential theory of the reals is the algorithmic problem of testing whether a given sentence belongs to this theory; equivalently, for strings that pass the basic syntactical checks (they use the correct symbols with the correct syntax, and have no unquantified variables) it is the problem of testing whether the sentence is a true statement about the real numbers. The set of -tuples of real numbers  for which  is true is called a semialgebraic set, so the decision problem for the existential theory of the reals can equivalently be rephrased as testing whether a given semialgebraic set is nonempty. In determining the time complexity of algorithms for the decision problem for the existential theory of the reals, it is important to have a measure of the size of the input. The simplest measure of this type is the length of a sentence: that is, the number of symbols it contains. However, in order to achieve a more precise analysis of the behavior of algorithms for this problem, it is convenient to break down the input size into several variables, separating out the number of variables to be quantified, the number of polynomials within the sentence, and the degree of these polynomials. Examples
The golden ratio  may be defined as the root of the polynomial . This polynomial has two roots, only one of which (the golden ratio) is greater than one. Thus, the existence of the golden ratio may be expressed by the sentence

Because the golden ratio is not transcendental, this is a true sentence, and belongs to the existential theory of the reals. The answer to the decision problem for the existential theory of the reals, given this sentence as input, is the Boolean value true. The inequality of arithmetic and geometric means states that, for every two non-negative numbers  and , the following inequality holds:

As stated above, it is a first-order sentence about the real numbers, but one with universal rather than existential quantifiers, and one that uses extra symbols for division, square roots, and the number 2 that are not allowed in the first-order theory of the reals. However, by squaring both sides it can be transformed into the following existential statement that can be interpreted as asking whether the inequality has any counterexamples:

The answer to the decision problem for the existential theory of the reals, given this sentence as input, is the Boolean value false: there are no counterexamples. Therefore, this sentence does not belong to the existential theory of the reals, despite being of the correct grammatical form. Algorithms
Alfred Tarski's method of quantifier elimination (1948) showed the existential theory of the reals (and more generally the first order theory of the reals) to be algorithmically solvable, but without an elementary bound on its complexity. The method of cylindrical algebraic decomposition, by George E. Collins (1975), improved the time dependence to doubly exponential, of the form

where  is the number of bits needed to represent the coefficients in the sentence whose value is to be determined,  is the number of polynomials in the sentence,  is their total degree, and  is the number of variables. By 1988, Dima Grigoriev and Nicolai Vorobjov had shown the complexity to be exponential in a polynomial of ,

and in a sequence of papers published in 1992 James Renegar improved this to a singly exponential dependence 

In the meantime, in 1988, John Canny described another algorithm that also has exponential time dependence, but only polynomial space complexity; that is, he showed that the problem could be solved in PSPACE. The asymptotic computational complexity of these algorithms may be misleading, because in practice they can only be run on inputs of very small size. In a 1991 comparison, Hoon Hong estimated that Collins' doubly exponential procedure would be able to solve a problem whose size is described by setting all the above parameters to 2, in less than a second, whereas the algorithms of Grigoriev, Vorbjov, and Renegar would instead take more than a million years. In 1993, Joos, Roy, and Solernó suggested that it should be possible to make small modifications to the exponential-time procedures to make them faster in practice than cylindrical algebraic decision, as well as faster in theory. However, as of 2009, it was still the case that general methods for the first-order theory of the reals remained superior in practice to the singly exponential algorithms specialized to the existential theory of the reals. Complete problems
Several problems in computational complexity and geometric graph theory may be classified as complete for the existential theory of the reals. That is, every problem in the existential theory of the reals has a polynomial-time many-one reduction to an instance of one of these problems, and in turn these problems are reducible to the existential theory of the reals. A number of problems of this type concern the recognition of intersection graphs of a certain type. In these problems, the input is an undirected graph; the goal is to determine whether geometric shapes from a certain class of shapes can be associated with the vertices of the graph in such a way that two vertices are adjacent in the graph if and only if their associated shapes have a non-empty intersection. Problems of this type that are complete for the existential theory of the reals include
recognition of intersection graphs of line segments in the plane,
recognition of unit disk graphs,
and recognition of intersection graphs of convex sets in the plane. For graphs drawn in the plane without crossings, Fáry's theorem states that one gets the same class of planar graphs regardless of whether the edges of the graph are drawn as straight line segments or as arbitrary curves. But this equivalence does not hold true for other types of drawing. For instance, although the crossing number of a graph (the minimum number of crossings in a drawing with arbitrarily curved edges) may be determined in NP, it is complete for the existential theory of the reals to determine whether there exists a drawing achieving a given bound on the rectilinear crossing number (the minimum number of pairs of edges that cross in any drawing with edges drawn as straight line segments in the plane). It is also complete for the existential theory of the reals to test whether a given graph can be drawn in the plane with straight line edges and with a given set of edge pairs as its crossings, or equivalently, whether a curved drawing with crossings can be straightened in a way that preserves its crossings. Other complete problems for the existential theory of the reals include:
 the art gallery problem of finding the smallest number of points from which all points of a given polygon are visible. training neural networks. the packing problem of deciding whether a given set of polygons can fit in a given square container. recognition of unit distance graphs, and testing whether the dimension or Euclidean dimension of a graph is at most a given value. stretchability of pseudolines (that is, given a family of curves in the plane, determining whether they are homeomorphic to a line arrangement);
 both weak and strong satisfiability of geometric quantum logic in any fixed dimension >2;
 Model checking interval Markov chains with respect to unambiguous automata. the algorithmic Steinitz problem (given a lattice, determine whether it is the face lattice of a convex polytope), even when restricted to 4-dimensional polytopes;
 realization spaces of arrangements of certain convex bodies
 various properties of Nash equilibria of multi-player games  
 embedding a given abstract complex of triangles and quadrilaterals into three-dimensional Euclidean space;
 embedding multiple graphs on a shared vertex set into the plane so that all the graphs are drawn without crossings;
 recognizing the visibility graphs of planar point sets;
 (projective or non-trivial affine) satisfiability of an equation between two terms over the cross product;
 determining the minimum slope number of a non-crossing drawing of a planar graph;
 recognizing graphs that can be drawn with all crossings at right angles;
 the partial evaluation problem for the MATLANG+eigen matrix query language. the low-rank matrix completion problem. Based on this, the complexity class  has been defined as the set of problems having a polynomial-time many-one reduction to the existential theory of the reals. See also
Hilbert's tenth problem, on the (undecidable) existential theory of the integers

References

Formal theories of arithmetic
Computational complexity theory
Real algebraic geometry