20 citations · 31 across the 10 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2022
Beyond the Existential Theory of the Reals
Marcus Schaefer, Daniel Stefankovic
We show that completeness at higher levels of the theory of the reals is a robust notion (under changing the signature and bounding the domain of the quantifiers). This mends recog…
cs.CC2016★ 5 cited
The Complexity of Tensor Rank
Marcus Schaefer, Daniel Stefankovic
We show that determining the rank of a tensor over a field has the same complexity as deciding the existential theory of that field. This implies earlier NP-hardness results by Hås…