Published on December 2, 2016 by Microsoft Research
Want create site? Find Free WordPress Themes and plugins.

The first question we computer scientists ask when facing a new algorithmic challenge is: is it NP-hard, or is it in P? Surprisingly, for many important problems, the answer is “neither!” I will discuss recent progress towards understanding the complexity of those problems.

See more on this video at

Did you find apk for android? You can find new Free Android Games and apps.

Leave a Reply

Be the First to Comment!

Notify of