The following pages link to (Q5743382):
Displayed 4 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)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)