context: In 1967, Manuel Blum developed an axiomatic complexity theory based on his axioms and proved an important result, the so-called, speed-up theorem. The field really began to flourish in 1971 when the US researcher Stephen Cook and, working independently, Leonid Levin in the USSR, proved that there exist practically relevant problems that are NP-complete. In 1972, Richard Karp took this idea a leap forward with his landmark paper, "Reducibility Among Combinatorial Problems", in which he showed that 21 diverse combinatorial and graph theoretical problems, each infamous for its computational intractability, are NP-complete.
question: ১৯৭২ সালে রিচার্ড কার্প যে কাগজটি লিখেছিলেন তা কি যা ইনট্রাকটেবিলিটি এবং এনপি-সম্পূর্ণ সমস্যার মধ্যে বোঝার এক নতুন যুগের সূচনা করেছিল?
answers: "Reducibility Among Combinatorial Problems" Reducibility Among Combinatorial Problems "Reducibility Among Combinatorial Problems"