Stack Exchange
sign up
|
log in
|
Computer Science
beta
Questions
Tags
Tour
Users
Ask Question
Badge
Student
Asked first question with score of 1 or more.
ksb earned this badge
feb 15 at 16:55
Are there subexponential-time algorithms for NP-complete problems?
Others with this badge
Computer Science Stack Exchange works best with JavaScript enabled