2013年5月2日
some np problem
摘要： SAT boolean satisfication , first np complete problemSet coverin G=(V,E)minimum vertex cover, a special case of set covermaximum clique,maximum indepedent setwhat is the defnination of NP? NPC? NP-hard? whtat is the meaning of NP!=P or NP=P?How to prove a problem is NPC?oracle machine? or Turing mac 阅读全文
posted @ 2013-05-02 21:58 xxx's blog 阅读(235) 评论(0) 推荐(0) 编辑