Mikkel Abrahamsen

activity

20172021

most citedDynamic Toolbox for ETRINV

6 citations · 12 across the 4 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2021

Geometric Embeddability of Complexes is $\exists R$ -complete

Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow

We show that the decision problem of determining whether a given (abstract simplicial) $k$ -complex has a geometric embedding in $R^{d}$ is complete for the Existential Theory…

cs.CC2019★ 6 cited

Dynamic Toolbox for ETRINV

Mikkel Abrahamsen, Tillmann Miltzow

Recently, various natural algorithmic problems have been shown to be $\exists R$ -complete. The reduction relied in many cases on the $\exists R$ -completeness of t…

Geometric Embeddability of Complexes is ∃R-complete

Dynamic Toolbox for ETRINV

Geometric Embeddability of Complexes is $\exists R$ -complete