The tensor spectral threshold decision problem is ∃R-hard via an explicit polynomial-time reduction from bounded quartic equality feasibility.
and Lim, Lek-Heng , title =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Gives explicit characterization and algorithm for Waring decompositions of symmetric tensors on rational varieties under a technical assumption, generalizing Hankel tensors, plus new quadrature bounds on rational curves.
Quantum algorithms for element-wise polynomial matrix transforms achieve exponential space reduction in polynomial degree with corrections to prior constructions.
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.
-
Symmetric tensor decomposition on rational varieties
Gives explicit characterization and algorithm for Waring decompositions of symmetric tensors on rational varieties under a technical assumption, generalizing Hankel tensors, plus new quadrature bounds on rational curves.
-
Quantum element-wise transforms
Quantum algorithms for element-wise polynomial matrix transforms achieve exponential space reduction in polynomial degree with corrections to prior constructions.