The following pages link to (Q5743382):
Displaying 7 items.
- AND-compression of NP-complete problems: streamlined proof and minor observations (Q309801) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- On the combination of the Bernays-Schönfinkel-Ramsey fragment with simple linear integer arithmetic (Q2405242) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- Co-Nondeterminism in Compositions (Q4962153) (← links)
- A fixed-depth size-hierarchy theorem for AC <sup>0</sup> [⊕] via the coin problem (Q5212785) (← links)
