Slide 1Exploring the border between P and NP Uriel Feige Weizmann Institute 1 Slide 2 Computational Intractability Convention: tractable = polynomial time. When a computational…
