Linear Objective Problems: A Complexity Framework for Bilevel Optimization
cs.CC, cs.DM, math.CO, math.OC
Submitted: 2026-11-08
Updated: 2026-11-08
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP
- A Compendium of Reductions: reductions.network
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?