Pages that link to "Item:Q5501928"

The following pages link to Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928):

Displaying 2 items.

• Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
• A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)