Badge
| Nice Answer | Answer score of 10 or more. This badge can be awarded multiple times. |
Bart Jansen earned this badge 7 times |
apr 5 '12 at 16:24
graphs where vertex coloring is in P but independent set is NP complete
mar 5 '12 at 19:25
Can I bound the cardinality of a set if testing for membership in it is known to be NP-complete?
nov 26 '11 at 6:42
Direct SAT to 3-SAT reduction
jun 8 '11 at 15:05
Number of edges in $K_4$-free graphs
dec 8 '10 at 9:27
Subexponentially solvable hard graph problems
sep 18 '10 at 20:47
Other kinds of running time analysis besides worst-case, average-case, etc?
