The following pages link to Co-Nondeterminism in Compositions (Q4962153):
Displaying 5 items.
- FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders (Q2828222) (← links)
- Hans Bodlaender and the Theory of Kernelization Lower Bounds (Q5042447) (← links)
- A fixed-depth size-hierarchy theorem for AC <sup>0</sup> [⊕] via the coin problem (Q5212785) (← links)
- Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms (Q5859672) (← links)
- Essentially tight kernels for (weakly) closed graphs (Q6103524) (← links)
