Pages that link to "Item:Q538466"
From MaRDI portal
The following pages link to Lower bounds for kernelizations and other preprocessing procedures (Q538466):
Displaying 14 items.
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- Parameterized random complexity (Q1946497) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- (Q5091010) (← links)
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
- (Q5743378) (← links)
- (Q5743381) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
