Reconfiguration of Time-Bounded Descriptions
cs.CC, cs.DM
Submitted: 2026-11-06
Updated: 2026-11-06
Terminology
Sources
- Asymptotic density, immunity, and randomness
- All Kolmogorov complexity functions are optimal, but are some more optimal?
- On Coupon Colorings of Graphs
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
- Limit on the computational power of $\mathrm{C}$-random strings
- Completely independent spanning trees in the hypercube
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?