Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

2018

2018

The existential theory of the reals (ETR) consists of existentially quantified boolean formulas over equalities and inequalities… Expand

Is this relevant?

Highly Cited

2015

Highly Cited

2015

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

Is this relevant?

2009

2009

Methods for deciding quantifier-free non-linear arithmetical conjectures over *** are crucial in the formal verification of many… Expand

Is this relevant?

2009

2009

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

Is this relevant?

Highly Cited

1998

Highly Cited

1998

We discuss interval techniques for speeding up the exact evaluation of geometric predicates and describe an efficient… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

The analysis to be proposed has two notable consequences. First, it indicates that while presupposition may play a role in… Expand

Is this relevant?

Highly Cited

1992

Highly Cited

1992

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

Is this relevant?

1991

1991

In this paper we compare the complexities of the following three decision algorithms on existential sentences over the reals… Expand

Is this relevant?

1988

1988

The problem of pushing projections in recursive rules has received little attention. The objective of this paper is to motivate… Expand

Is this relevant?

1988

1988

The decision problem for the existential theory of the reals is the problem of deciding if the set (x in R/sup n/; P(x) is… Expand

Is this relevant?