On classifying continuous constraint satisfaction problems

Cites work

scientific article; zbMATH DE number 17663 (Why is no real title available?)
scientific article; zbMATH DE number 2107836 (Why is no real title available?)
A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games.
A dichotomy theorem for constraint satisfaction problems on a 3-element set
A proof of the CSP dichotomy conjecture
A structure theorem for semibounded sets in the reals
Additive reducts of real closed fields
Algorithms in real algebraic geometry
An approximation trichotomy for Boolean \#CSP
Approximating the existential theory of the reals
Bounding the radii of balls meeting every connected component of semi-algebraic sets
Complexity of geometric \(k\)-planarity for fixed \(k\)
Complexity of some geometric and topological problems
Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
Constraint satisfaction problems over numeric domains
Essential convexity and complexity of semi-algebraic constraints
Fixed points, Nash equilibria, and the existential theory of the reals
How Do Exponential Size Solutions Arise in Semidefinite Programming?
Improved dense packings of congruent squares in a square
Integer realizations of disk and segment graphs
Intersection graphs of rays and grounded segments
Intersection graphs of segments
Non-dichotomies in Constraint Satisfaction Complexity
On restricted nonnegative matrix factorization
On the Complexity of Numerical Analysis
On the computational complexity of decision problems about multi-player Nash equilibria
On the minimum of a positive polynomial over the standard simplex
Parameterized complexity of constraint satisfaction problems
Realizability of graphs and linkages
Realization spaces of 4-polytopes are universal
Recognition and complexity of point visibility graphs
Reducts of some structures over the reals
SOS is not obviously automatizable, even approximately
Semidefinite programming and arithmetic circuit evaluation
Smoothing the Gap Between NP and ER
Sphere and dot product representations of graphs
The Art Gallery Problem is ∃ℝ-complete
The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains
The complete classification for quantified equality constraints
The complexity of drawing a graph in a polygonal region
The complexity of positive semidefinite matrix factorization
The complexity of satisfiability problems
The complexity of temporal constraint satisfaction problems
The complexity of tensor rank
\(\forall\exists\mathbb {R}\)-completeness and area-universality

Cited in

(1)

Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems

This page was built for publication: On classifying continuous constraint satisfaction problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566470)