Hardness of Approximation Between P and NP

Опубликовано 2 декабря 2016, 18:45

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 microsoft.com/en-us/research/v...