Richard M. Karp

 

(¹Ì±¹ ÄÄÇ»ÅÍ°úÇÐÀÚ, 1935~)

Richard M. Karp ´Â ¾Ë°í¸®ÁòÀÌ·ÐÀÇ ¿¬±¸·Î À¯¸íÇÑ ÄÄÇ»ÅÍ°úÇÐÀڷμ­ 1985 ³â¿¡ Turing Award ¸¦ ¼ö»óÇß´Ù. ±×´Â º¸½ºÅæ¿¡¼­ Ãâ»ýÇÏ¿© ÇÏ¹Ùµå ´ëÇп¡¼­ ÀÀ¿ë¼öÇÐ (applied mathematics) ·Î 1959 ³â¿¡ ¹Ú»çÇÐÀ§¸¦ ¹Þ¾Ò´Ù. IBM Thomas J. Watson Research Center ¿¡¼­ Àá½Ã ÀÖ¾ú°í, University of California, Berkeley ¿¡¼­ ÄÄÇ»ÅÍ°úÇÐ, ¼öÇÐ, °æ¿µ°úÇÐ (operations research) ±³¼ö¸¦ Áö³ÂÀ¸¸ç Àá½Ã University of Washington ¿¡ ÀÖ¾ú´Ù. ±×´Â °è»êº¹Àâµµ (computational complexity) ÀÇ ¾÷ÀûÀ¸·Î 2004 Benjamin Franklin Medal in Computer and Cognitive Science ¸¦ ¼ö»óÇß´Ù. Æ©¸µ»óÀ» ¼ö»óÇϸ鼭 ±×ÀÇ ¾÷ÀûÀ» ´ÙÀ½°ú °°ÀÌ ¹¦»çÇß´Ù.

1971 ³â¿¡ Jack Edmonds ¿Í ÇÔ²² ³×Æ®¿öÅ©¿¡¼­ max-flow problem À» ÇØ°áÇÏ´Â Edmonds-Karp algorithm ¸¦ °³¹ßÇß´Ù. 1987 ³â¿¡´Â Michael O. Rabin °ú ÇÔ²² Rabin-Karp string search algorithm À» °³¹ßÇß´Ù. ±×´Â ÄÄÇ»ÅÍ°úÇаú °æ¿µ°úÇп¡¼­ÀÇ combinatorial algorithms ¿µ¿ª¿¡¼­ ¸¹Àº Áß¿äÇÑ ¹ß°ßÀ» Çß´Ù. ÃÖ±Ù¿¡´Â bioinformatics ºÐ¾ß¸¦ ¿¬±¸ÇÏ°í ÀÖ´Ù. .......... (Wikipedia : Richard Karp)

term :

¾Ë°í¸®Áò (Algorithm)   Á¶ÇÕÃÖÀûÈ­ (Combinatorial Optimization)   °è»ê (Computation)   °è»êº¹Àâµµ ÀÌ·Ð (Computational Complexity Theory)   ºñ°áÁ¤ ¿ÏÀü (NP-complete)   °æ¿µ°úÇÐ (Operation Research)   Michael Rabin   Richard Karp   A.M. Turing Award

site :

ACM Crossroads magazine interview/bio of Richard Karp

Karp's Home Page at Berkeley 

Karp at ICIR : papers

paper :

Reducibility among combinatorial problems. In Miller, R. E. & Thatcher, J. W., editors, Complexity of Computer Computations, Plenum, New York. 1972

video :

Heuristics for NP-Hard Problems : Richard Karp : 2011/10/16