Karp on formulating the P = NP question.

Richard Karp, winner of the Association for Computing Machinery's A.M. Turing Award, explains his formulation of the P=NP question while writing the paper “Reducibility Among Combinatorial Problems” (1972). This clip is taken from an interview conducted by Christos Papadimitriou for the Simons Foundation on April 23, 2012. For more information see Karp’s ACM profile at amturing.acm.o... or watch the full video from the Simons Foundation at www.simonsfoun....