Revision as of 20:24, 21 April 2007 edit Uri Even-Chen (talk \| contribs) 17 edits Are there really hard problems? ← Previous edit		Revision as of 21:00, 21 April 2007 edit undo Intgr (talk \| contribs) Autopatrolled, Extended confirmed users, New page reviewers, Pending changes reviewers 32,266 edits →Are there really hard problems?: Wikipedia is not the place for this Next edit →
Line 100: I published a proof that there is no proof that any decidable decision function is not in O(n). It can even be extended to O(1). ~~[http://www.speedy.net/uri/blog/?p=19]~~ Any comments? [[User:Uri Even-Chen\|Uri Even-Chen]] 20:24, 21 April 2007 (UTC) :Wikipedia talk pages are for discussing the article, not for discussing or promoting your research (and blogs are generally not considered [[WP:RS\|reliable sources]], so that shouldn't be cited in the article); this behavior can be considered [[WP:CANVASS\|canvassing]]. I have removed the link from your comment. :I realize that you were probably acting in good faith, but sorry, Wikipedia is not the place to do it. -- [[User:Intgr\|intgr]] 21:00, 21 April 2007 (UTC)

Talk:Computational complexity theory: Difference between revisions