Theoretical Computer Science

Enlightened

 Enlightened
First to answer and accepted with score of 10 or more. This badge can be awarded multiple times.

earned this badge 2 times.
Are there applications of modular graph decomposition in TCS/complexity theory?
Awarded Jan 14, 2014 at 18:19
Problems with complexity between P and NP that have NP-complete generalizations
Awarded Apr 7, 2012 at 17:40

Others with this badge

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.