´Ü¾î | KarpÀÇ 21 NP-COMPLETE ¹®Á¦ |
---|---|
Karp¡¯s 21 NP-complete problems | |
¼³¸í | °è»ê º¹Àâµµ ÀÌ·ÐÀÇ °¡Àå Áß¿äÇÑ °á°ú Áß Çϳª´Â Stephen CookÀÇ 1971³â ³í¹®¿¡¼ NP-COMPLETE¿Í ºÒÀÇ ¸¸Á· ¹®Á¦(Boolean satisfiability problem)ÀÌ´Ù. 1972³â¿¡ Richard Karp´Â ÀÌ·¯ÇÑ ¾ÆÀ̵ð¾î¸¦ »ç¿ëÇؼ ³í¹® ¡°Reducibility Among Combinatorial Problems¡±¸¦ ³»³õ¾Ò´Ù. ÀÌ ³í¹®¿¡¼ Richard Karp´Â 21°³ÀÇ ´Ù¾çÇÑ Á¶ÇÕ ¹®Á¦¿Í ±×·¡ÇÁ ÀÌ·Ð ¹®Á¦¸¦ º¸¿´´Ù. ¿©±â¿¡ ³ª¿Â 21°³ÀÇ ¹®Á¦µéÀº ¸ðµÎ NP-COMPLETE·Î ´Ù·ç±â Èûµç ¹®Á¦·Î ¼Õ²ÅÇû´Ù. |
Copyright(c) Computer Science Engineering Research Information Center. All rights reserved.