Order type realizability, ∃R-complete in the worst case, can be decided in expected NP time under smoothed analysis.
The complexity of tensor rank
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Partition ranks bound multiplicative complexity from below for constant-degree multilinear arithmetic circuits, generalizing Strassen's tensor-rank characterization.
citing papers explorer
-
Smoothed Analysis of Order Types
Order type realizability, ∃R-complete in the worst case, can be decided in expected NP time under smoothed analysis.
-
Partition Rank and Algebraic Circuit Lower Bounds
Partition ranks bound multiplicative complexity from below for constant-degree multilinear arithmetic circuits, generalizing Strassen's tensor-rank characterization.