On the complexity of isomorphism problems for tensors, groups, and polynomials V: over commutative rings
cs.CC, math.AC, math.NT
Submitted: 2026-10-31
Updated: 2026-10-31
Terminology
Sources
- The Module Isomorphism Problem for Finite Rings and Related Results
- Counting Calabi-Yau Threefolds
- On the complexity of isomorphism problems for tensors, groups, and polynomials IV: linear-length reductions and their applications
- Distinguishing Calabi-Yau Topology using Machine Learning
- Search for $X(3872)\to\pi^0\chi_{c0}$ and $X(3872)\to\pi\pi\chi_{c0}$ at BESIII
- On the Group and Color Isomorphism Problems
- Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing
- Finding direct product decompositions in polynomial time
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?