Talk:Computational complexity theory: Difference between revisions

Content deleted Content added
SineBot (talk | contribs)
m Signing comment by 98.221.87.128 - ""
Graph Theory: new section
Line 215:
 
"The fact that the P − NP problem has not been solved, and indeed has been shown to be unsolvable..." Is this right, and if so, reference? <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:J. Holden Caulfield|J. Holden Caulfield]] ([[User talk:J. Holden Caulfield|talk]] • [[Special:Contributions/J. Holden Caulfield|contribs]]) 17:34, 31 March 2009 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot-->
 
== Graph Theory ==
 
The section on graph theory is little more than a link to the graph theory page. The text inside doesn;t really referenc graph theory that much, or at least it doesn't explain the connection in graph theoretic terms. Perhaps it could be expanded, or removed? Any thoughts? [[Special:Contributions/86.145.23.98|86.145.23.98]] ([[User talk:86.145.23.98|talk]]) 13:57, 9 May 2009 (UTC)