Determinant boundaries and gaps in determinantal complexity
cs.CC
Submitted: 2026-11-02
Updated: 2026-11-02
Terminology
Sources
- Orbit closures, stabilizer limits and intermediate $G$-varieties
- Factoring the Adjoint and Maximal Cohen--Macaulay Modules over the Generic Determinant
- Large spaces of bounded rank matrices revisited
- On Linear spaces of of matrices bounded rank
- On the complexity of the permanent in various computational models
- Equivariant spaces of matrices of constant rank
- The Exact Reach of Conormal Invariants in Determinantal Complexity: a Quadratic No-Go Theorem
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?