\(\forall\exists\mathbb {R}\)-completeness and area-universality

DOI10.1007/978-3-030-00256-5_14OpenAlexW2963575622MaRDI QIDQ1627164

Paweł Rzążewski, Tillmann Miltzow, Linda Kleist, Michael Gene Dobbins

Publication date: 22 November 2018

Full work available at URL: https://arxiv.org/abs/1712.05142

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Between shapes, using the Hausdorff distance ⋮ The complexity of the Hausdorff distance ⋮ Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality ⋮ Unnamed Item ⋮ The complexity of drawing a graph in a polygonal region ⋮ On Area-Universal Quadrangulations ⋮ Computational complexity of multi-player evolutionarily stable strategies