Linda Kleist

activity

20152026

\exists R

-complete

11 citations · 16 across the 11 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.CC2021★ 11 cited

Training Neural Networks is $\exists R$ -complete

Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow

Given a neural network, training data, and a threshold, it was known that it is NP-hard to find weights for the neural network such that the total error is below the threshold. We…

Geometric Embeddability of Complexes is ∃R-complete

Training Neural Networks is ∃R-complete

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

Training Neural Networks is $\exists R$ -complete