Beyond the Existential Theory of the Reals (Q6489317)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7835105

Language	Label	Description	Also known as
English	Beyond the Existential Theory of the Reals	scientific article; zbMATH DE number 7835105

Statements

scholarly article

0 references

Beyond the Existential Theory of the Reals (English)

0 references

Marcus Schaefer

0 references

Daniel Štefanković

0 references

Theory of Computing Systems

0 references

publication date

21 April 2024

0 references

MaRDI profile type

MaRDI publication profile

0 references

The complexity of the Hausdorff distance

0 references

0 references

\(\forall\exists\mathbb {R}\)-completeness and area-universality

0 references

Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality

0 references

Computational complexity of multi-player evolutionarily stable strategies

0 references

Fixed points, Nash equilibria, and the existential theory of the reals

0 references

Exotic quantifiers, complexity classes, and complete problems

0 references

0 references

Algorithms in real algebraic geometry

0 references

The Art Gallery Problem is ∃ℝ-complete

0 references

The Complexity of Angular Resolution

0 references

On the computational complexity of decision problems about multi-player Nash equilibria

0 references

Some provably hard crossing number problems

0 references

Intersection graphs of segments

0 references

0 references

0 references

Read-once polynomial identity testing

0 references

Real addition and the polynomial hierarchy

0 references

COMPLEXITY AND REAL COMPUTATION: A MANIFESTO

0 references

On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

0 references

Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets

0 references

Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem

0 references

Effective Łojasiewicz inequalities in semialgebraic geometry

0 references

On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals

0 references

On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination

0 references

On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination

0 references

On the minimum of a positive polynomial over the standard simplex

0 references

Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences

0 references

Realizability of Graphs and Linkages

0 references

0 references

The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete.

0 references

Generalizations of matched CNF formulas

0 references

Computing the real isolated points of an algebraic hypersurface

0 references

0 references

An exact duality theory for semidefinite programming and its complexity implications

0 references

Semidefinite programming and combinatorial optimization

0 references

On the Complexity of Numerical Analysis

0 references

Smoothing the Gap Between NP and ER

0 references

Identifiers

10.1007/s00224-023-10151-x

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6489317

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6489317&oldid=38012961"