Sciweavers

Share
GD
2009
Springer

Complexity of Some Geometric and Topological Problems

8 years 10 months ago
Complexity of Some Geometric and Topological Problems
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on the rectilinear crossing number and intersection graphs of line segments, we argue that there is a need to recognize this level of complexity as its own class.
Marcus Schaefer
Added 04 Sep 2010
Updated 04 Sep 2010
Type Conference
Year 2009
Where GD
Authors Marcus Schaefer
Comments (0)
books