On Positive Computation
cs.CC, cs.LO
Submitted: 2026-11-06
Updated: 2026-11-06
Project page: https://chalmersgu-data-structure-courses.github.io/OpenDSA/Published/ChalmersGU-DSABook
Terminology
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?