In mathematical logic, computational complexity theory, and computer science, the existential theory of the reals is the set of all true sentences of… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

Methods for deciding quantifier-free non-linear arithmetical conjectures over R are crucial in the formal verification of many… (More)

Is this relevant?

2017

2017

- Paul B. Jackson
- 2017

Methods for deciding quantifier-free non-linear arithmetical conjectures over R are crucial in the formal verification of many… (More)

Is this relevant?

2017

2017

- Vittorio Bilò, Marios Mavronicolas
- STACS
- 2017

We study the complexity of decision problems about symmetric Nash equilibria for symmetric multi-player games. These decision… (More)

Is this relevant?

2015

2015

- Marcus Schaefer, Daniel Stefankovic
- Theory of Computing Systems
- 2015

We introduce the complexity class ∃ ℝ $\exists \mathbb {R}$ based on the existential theory of the reals. We show that the… (More)

Is this relevant?

2015

2015

- Jean Cardinal, Udo Hoffmann
- Symposium on Computational Geometry
- 2015

A point visibility graph is a graph induced by a set of points in the plane, where every vertex corresponds to a point, and two… (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- Dejan Jovanovic, Leonardo Mendonça de Moura
- IJCAR
- 2012

We propose a new decision procedure for the existential theory of the reals. It performs a backtracking search for a model in R… (More)

Is this relevant?

2009

2009

- Grant Olney Passmore, Paul B. Jackson
- Calculemus/MKM
- 2009

Methods for deciding quantifier-free non-linear arithmetical conjectures over R are crucial in the formal verification of many… (More)

Is this relevant?

2009

2009

- Marcus Schaefer
- Graph Drawing
- 2009

We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory… (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- James Renegar
- J. Symb. Comput.
- 1992

This series of papers presents a complete development and complexity analysis of a decision method, and a quantifier elimination… (More)

Is this relevant?

1988

1988

- Lenore Blum, Michael Shub, Stephen Smale
- FOCS
- 1988

We present a model for computation over an arbitrary (ordered) ring R. In this general setting, we obtain universal machines… (More)

Is this relevant?