The tensor spectral threshold decision problem is ∃R-hard via an explicit polynomial-time reduction from bounded quartic equality feasibility.
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
-
Tensor Spectral Threshold is $\exists\mathbb{R}$-Hard
The tensor spectral threshold decision problem is ∃R-hard via an explicit polynomial-time reduction from bounded quartic equality feasibility.