How Hard Is It to Compute Cover Time?
cs.CC
Submitted: 2026-10-28
Updated: 2026-11-03
Comments: 24 pages including title page, 3 figures. Substantially reorganized and shortened from 29 pages, with simplified proofs, expanded explanations, and revised figures
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
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?