Realizability of Graphs and Linkages

2012/10/29 by Marcus Schaefer · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Combinatorics #Computational Geometry and Mesh Generation #Discrete mathematics #Existential quantification #Graph #Graph Theory and Algorithms #Linkage (software) #Mathematics #Realizability #Realization (probability) #Topological graph

paper · doi:10.1007/978-1-4614-0110-0_24

crossref issued 2012/10/29 · crossref published 2012/10/29 · crossref published-online 2012/10/29 · openalex publication_date 2012/10/29 · crossref created 2012/12/13 · crossref published-print 2013/01/01 · crossref deposited 2023/06/27 · openalex created_date 2025/10/10 · crossref indexed 2026/07/31 · openalex updated_date 2026/08/04

Citations

• On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Complexity of Some Geometric and Topological Problems
• Geometric Folding Algorithms: Linkages, Origami, Polyhedra
• Oriented Matroids
• Algorithms in Real Algebraic Geometry

Cited by

• Unit distance graph [wikipedia]