Pages that link to "Item:Q5145356"

The following pages link to Parameterized circuit complexity of model-checking on sparse structures (Q5145356):

Displaying 3 items.

• Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
• Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits (Q1987509) (← links)
• On the Descriptive Complexity of Color Coding (Q5090457) (← links)