Tensor degeneracy is ∃ℝ-complete via exact algebraic reductions from quadratic feasibility, while hyperdeterminant vanishing's deterministic hardness reduces to a structured PIT instance.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
$\exists\mathbb{R}$-Completeness of Tensor Degeneracy and a Derandomization Barrier for Hyperdeterminants
Tensor degeneracy is ∃ℝ-complete via exact algebraic reductions from quadratic feasibility, while hyperdeterminant vanishing's deterministic hardness reduces to a structured PIT instance.