Revision as of 12:12, 14 September 2009 edit Easwaran (talk \| contribs) 48 edits →P-NP not solvable? ← Previous edit		Revision as of 12:17, 21 September 2009 edit undo Hermel (talk \| contribs) Extended confirmed users, Pending changes reviewers 2,052 edits →New structure?: removed analysis of algorithms part Next edit →
Line 244: ::Removing everything related to algorithm analysis sounds fine to me. We already have the article [[Analysis of algorithms]]; we can simply refer to it. — [[User:Miym\|Miym]] ([[User talk:Miym\|talk]]) 13:41, 15 June 2009 (UTC) :::I just did that and started translating portions of the German article. This had been previoulsy suggested at this talk page. My German is certainly not perfect, and I did not translate everything literally. [[User:Hermel\|Hermel]] ([[User talk:Hermel\|talk]]) 12:17, 21 September 2009 (UTC) == Needs some kind of note/cross-reference to Kolmogorov Complexity, and other remarks ==

Talk:Computational complexity theory: Difference between revisions