Computer Science - approximation algorithms
http://drupal.cs.grinnell.edu/drupal6/taxonomy/term/501/0
enCS Table (Friday, February 7, 2014): "P vs. NP"
http://drupal.cs.grinnell.edu/drupal6/node/677
<p>
This Friday at CS Table, we will consider the classic “<b>P</b> vs. <b>NP</b>” problem.
</p>
<blockquote>
<p>
Fortnow, Lance. <a href="http://doi.acm.org/10.1145/1562164.1562186">“The status of the P versus NP problem.”</a> <i>Communications of the ACM</i> <b>52</b> (2009), no. 9, pp. 78–86.
</p>
<p>
In this article I look at how people have tried to solve the P versus NP problem as well as how this question has shaped so much of the research in computer science and beyond. I will look at how to handle NP-complete problems and the theory that has developed from those approaches. I show how a new type of “interactive proof systems” led to limitations of approximation algorithms and consider whether quantum computing can solve NP-complete problems (short answer: not likely). And I close by describing a new long-term project that will try to separate P from NP using algebraic-geometric techniques.
</p>
<p>
This article does not try to be totally accurate or complete either technically or historically, but rather informally describes the P versus NP problem and the major directions in computer science inspired by this question over the past several decades.
</p>
</blockquote>
<p>
Computer Science Table is an open weekly meeting of Grinnell College community members (students, faculty, staff, etc.) interested in discussing topics related to computing and computer science.
</p>
http://drupal.cs.grinnell.edu/drupal6/node/677#commentsapproximation algorithmscomputational complexityCS Tableineractive proof systemsquantum computingThu, 06 Feb 2014 19:55:41 +0000stone677 at http://drupal.cs.grinnell.edu/drupal6