On the average-case complexity landscape for Tensor-Isomorphism-complete problems over finite fields
cs.CC, cs.DS, math.PR
Submitted: 2026-04-01
Updated: 2026-11-03
Project page: https://pqcalteq.github.io
Terminology
Sources
- Random tensor isomorphism under orthogonal and unitary actions
- Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?