Skip to main content
Conference ProceedingsOPEN ACCESS

Complexity of some geometric and topological problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 5849 LNCS 334-344
DOI: 10.1007/978-3-642-11805-0_32
99Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Schaefer, M. (2010). Complexity of some geometric and topological problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5849 LNCS, pp. 334–344). https://doi.org/10.1007/978-3-642-11805-0_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free