Badge

 Nice Answer Answer score of 10 or more. This badge can be awarded multiple times.

vb le earned this badge 3 times
apr 25 at 14:45
Reference for NP-hardness of 3-colouring?
mar 10 at 16:32
Is the feedback vertex set problem on planar bounded degree graphs hard?
dec 2 at 21:34
Hardness of approximation without the PCP theorem

Others with this badge