Revision as of 20:00, 14 October 2009 edit Doradus (talk \| contribs) Extended confirmed users, Pending changes reviewers 6,033 edits →Needs some kind of note/cross-reference to Kolmogorov Complexity, and other remarks: also disagree ← Previous edit		Revision as of 23:36, 21 October 2009 edit undo RobinK (talk \| contribs) Extended confirmed users, Pending changes reviewers 3,059 edits Changed math rating: We need more Top priority articles in Discrete Math according to suggested ratios; It's also an absolute "must-have" article. Next edit →
Line 25: \|small= \|class=B \|importance=~~high~~top \|field=discrete \|historical= Line 33: {{FAOL\|German\|de:Komplexitätstheorie\|small=yes}} {{WP1.0\|v0.7=pass\|class=B\|category=Mathematics\|small=yes}} ==older entries== I wonder where would be a good place to mention that we know some problems not in '''P''', for instance [[:Presburger arithmetic\|Presburger arithmetic]]. --AxelBoldt

Talk:Computational complexity theory: Difference between revisions