Abstract
AbstractExhibiting a deep connection between purely geometric problems and real algebra, the complexity class $$\exists \mathbb {R}$$
∃
R
plays a crucial role in the study of geometric problems. Sometimes $$\exists \mathbb {R}$$
∃
R
is referred to as the ‘real analog’ of NP. While NP is a class of computational problems that deals with existentially quantified boolean variables, $$\exists \mathbb {R}$$
∃
R
deals with existentially quantified real variables. In analogy to $$\Pi _2^p$$
Π
2
p
and $$\Sigma _2^p$$
Σ
2
p
in the famous polynomial hierarchy, we study the complexity classes $$\forall \exists \mathbb {R}$$
∀
∃
R
and $$ \exists \forall \mathbb {R}$$
∃
∀
R
with real variables. Our main interest is the AreaUniversality problem, where we are given a plane graph G, and ask if for each assignment of areas to the inner faces of G, there exists a straight-line drawing of G realizing the assigned areas. We conjecture that AreaUniversality is $$\forall \exists \mathbb {R}$$
∀
∃
R
-complete and support this conjecture by proving $$\exists \mathbb {R}$$
∃
R
- and $$\forall \exists \mathbb {R}$$
∀
∃
R
-completeness of two variants of AreaUniversality. To this end, we introduce tools to prove $$\forall \exists \mathbb {R}$$
∀
∃
R
-hardness and membership. Finally, we present geometric problems as candidates for $$\forall \exists \mathbb {R}$$
∀
∃
R
-complete problems. These problems have connections to the concepts of imprecision, robustness, and extendability.
Funder
Nederlandse Organisatie voor Wetenschappelijk Onderzoek
European Research Council
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference49 articles.
1. Abrahamsen, M., Adamaszek, A., Miltzow, T.: The art gallery problem is $$\exists \mathbb{R}$$-complete. In: 50th Annual ACM SIGACT Symposium on Theory of Computing (Los Angeles 2018), pp. 65–73. ACM, New York (2018)
2. Abrahamsen, M., Kleist, L., Miltzow, T.: Training neural networks is $$\exists {\mathbb{R} }$$-complete (2021). arXiv:2102.09798
3. Abrahamsen, M., Miltzow, T.: Dynamic toolbox for ETRINV (2019). arXiv:1912.08674
4. Abrahamsen, M., Miltzow, T., Seiferth, N.: Framework for ER-completeness of two-dimensional packing problems. In: 61st Annual Symposium on Foundations of Computer Science, pp. 1014–1021. IEEE, Los Alamitos (2020)
5. Akitaya, H.A., Fulek, R., Tóth, C.D.: Recognizing weak embeddings of graphs. ACM Trans. Algorithms 15(4), # 50 (2019)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献