Badge
| Nice Answer | Answer score of 10 or more. This badge can be awarded multiple times. |
Hsien-Chih Chang 張顯之 earned this badge 17 times |
jan 15 at 1:03
Common false beliefs in theoretical computer science
dec 2 at 17:04
Does LOGLOG = NLOGLOG?
jul 17 at 1:22
Reference for (odd-hole,antihole)-free graphs?
apr 1 '12 at 21:07
How do you get a “Physical Intuition” for results in TCS?
mar 11 '12 at 10:54
Drawing graphs of bounded crossing number
mar 17 '11 at 11:01
Lower Bounds for Data Structures
mar 7 '11 at 2:50
Circle graph visualisation
feb 13 '11 at 22:02
Finding a prime greater than a given bound
feb 9 '11 at 7:44
Subexponentially solvable hard graph problems
feb 5 '11 at 3:00
What's the approximation factor of this Max k-Cut approximation?
dec 29 '10 at 3:30
Open problems on the frontiers of TCS
dec 22 '10 at 17:06
Ramsey's theorem for collections of sets
dec 9 '10 at 22:59
Conditions for NFA universality
dec 8 '10 at 7:07
Common false beliefs in theoretical computer science
dec 2 '10 at 17:35
“Overflow” in Extended Euclidean Algorithm
oct 29 '10 at 17:19
what is easy for minor-excluded graphs?
oct 24 '10 at 13:45
Logspace algorithms on graphs with bounded tree width
