On classifying continuous constraint satisfaction problems

Cites Work

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

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)