Revision as of 17:08, 24 November 2009 edit 71.130.241.52 (talk) No edit summary ← Previous edit		Revision as of 17:10, 24 November 2009 edit undo SineBot (talk \| contribs) Bots 2,564,724 edits m Signing comment by 71.130.241.52 - "" Next edit →
Line 90: not necessarily halt for all inputs; and 3. SAT's weakness: the complexity class of the SAT maybe does not decide P versus NP question <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/71.130.241.52\|71.130.241.52]] ([[User talk:71.130.241.52\|talk]]) 17:08, 24 November 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--> ~~NP question~~ ==older entries==

Talk:Computational complexity theory: Difference between revisions