Pages that link to "Item:Q1229753"
From MaRDI portal
The following pages link to A note on the complexity of the chromatic number problem (Q1229753):
Displaying 8 items.
- Dual parameterization of Weighted Coloring (Q5009474) (← links)
- Testing the Complexity of a Valued CSP Language (Q5091236) (← links)
- Faster graph coloring in polynomial space (Q5925619) (← links)
- On the complexity of \(k\)-SAT (Q5943094) (← links)
- Exponential-time quantum algorithms for graph coloring problems (Q5970782) (← links)
- Deciding 3-colourability in less than O(1.415n) steps (Q6143975) (← links)
- On the hardness of inclusion-wise minimal separators enumeration (Q6195343) (← links)
- A new approach on solving 3-satisfiability (Q6560377) (← links)
