Computational Complexity. Problem complexity vs. algorithmic complexity Upper bounds vs. lower bounds Exact solutions vs. approximate solutions Deterministic.
UGC & SDP, or, Are there any more polynomial time algorithms? Ryan O’Donnell Microsoft Research.
