{"id":318,"date":"2010-10-25T10:17:57","date_gmt":"2010-10-25T10:17:57","guid":{"rendered":"http:\/\/junq.info\/?p=318"},"modified":"2011-02-16T21:32:23","modified_gmt":"2011-02-16T21:32:23","slug":"is-p-equal-to-np","status":"publish","type":"post","link":"http:\/\/junq.info\/?p=318","title":{"rendered":"Is <strong>P<\/strong> equal to <strong>NP<\/strong>?"},"content":{"rendered":"<p><em> Question of the Week, 25. 10. 2010 <\/em><\/p>\n<p>This question is one of the seven so called <a href=\"http:\/\/en.wikipedia.org\/wiki\/Millennium_Prize_Problems\">Millennium Prize Problems<\/a>. It is in fact generally considered the most important open question in computer science.<\/p>\n<p>To very simply present the topic. <strong>P<\/strong> represents the class of decision problems that can be solved <em>efficiently<\/em> (in polynomial time) on a computer. <strong>NP<\/strong> consists of all decision problems whose solutions can be verified <em>efficiently<\/em> on a computer. And the question is whether every problem whose solution (when given) can be <em>efficiently<\/em> checked can also be <em>efficiently<\/em> solved.<\/p>\n<p>People believe that P != NP, but the correct proof has not been done yet.<\/p>\n<p>For further information see: <a href=\"http:\/\/en.wikipedia.org\/wiki\/P_versus_NP_problem\">http:\/\/en.wikipedia.org\/wiki\/P_versus_NP_problem<\/a><\/p>\n<p>Libor Veis<\/p>\n","protected":false},"excerpt":{"rendered":"<p>This question is one of the seven so called <a href=\"http:\/\/en.wikipedia.org\/wiki\/Millennium_Prize_Problems\">Millennium Prize Problems<\/a>. It is in fact generally considered the most important open question in computer science&#8230; (Question of the Week, 25. 10. 2010) <\/p>\n","protected":false},"author":8,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":true,"template":"","format":"standard","meta":{"neve_meta_sidebar":"","neve_meta_container":"","neve_meta_enable_content_width":"","neve_meta_content_width":0,"neve_meta_title_alignment":"","neve_meta_author_avatar":"","neve_post_elements_order":"","neve_meta_disable_header":"","neve_meta_disable_footer":"","neve_meta_disable_title":"","footnotes":""},"categories":[6],"tags":[],"aioseo_notices":[],"_links":{"self":[{"href":"http:\/\/junq.info\/index.php?rest_route=\/wp\/v2\/posts\/318"}],"collection":[{"href":"http:\/\/junq.info\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/junq.info\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/junq.info\/index.php?rest_route=\/wp\/v2\/users\/8"}],"replies":[{"embeddable":true,"href":"http:\/\/junq.info\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=318"}],"version-history":[{"count":3,"href":"http:\/\/junq.info\/index.php?rest_route=\/wp\/v2\/posts\/318\/revisions"}],"predecessor-version":[{"id":582,"href":"http:\/\/junq.info\/index.php?rest_route=\/wp\/v2\/posts\/318\/revisions\/582"}],"wp:attachment":[{"href":"http:\/\/junq.info\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=318"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/junq.info\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=318"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/junq.info\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=318"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}