Talk:Computational complexity theory: Difference between revisions

Revision as of 14:58, 9 June 2021

Latest revision as of 19:46, 4 June 2025

(11 intermediate revisions by 8 users not shown)

Line 1:

{{Skip to talk}}

{{Talk header}}

{{ArticleHistoryArticle history|action1=RBP

{{Vital article|level=4|topic=Mathematics|class=C}}

{{WikiProjectBannerShell|1=

{{WikiProject Computer science|class=c|importance=Top}}

{{WikiProject Systems|class=c|importance=mid}}

{{maths rating|frequentlyviewed=yes|class=B|importance=high |field=discrete |historical= }}

{{WikiProject Computing|class=c|importance=Mid}}}}

{{ArticleHistory|action1=RBP

|action1date=12:29, 19 January 2004

|action1link=Wikipedia:Archive/Refreshing brilliant prose - Science

Line 26 ⟶ 20:

|currentstatus=FFA

}}

{{WikiProject banner shell|class=B|vital=yes|1=

{{WP1.0|v0.7=pass|class=c|category=Math|small=yesWikiProject Computer science|importance=midTop}}

{{WikiProject Computer science|class=cSystems|importance=TopMid}}

{{WikiProject Systems|class=cMathematics|importance=mid}}

{{WikiProject Computing|class=c|importance=Mid}}}}

}}

==older entries==

Line 51 ⟶ 49:

*Support removal. The weird thing is that I don't even see this article on [[Wikipedia:Featured article candidates/Featured log]]. When the WP:FA page was new, a lot of people added articles themselves, as the candidate process was kind of unclear. - [[User:DropDeadGorgias|DropDeadGorgias]] [[User_talk:DropDeadGorgias|(talk)]] 17:02, Jul 26, 2004 (UTC)

* Support removal; this is nowhere near comprehensive. [[User:Matt Crypto|— Matt]] 17:32, 27 Jul 2004 (UTC)

* Remove posthaste. The "notable researchers" section is particularly disturbing; you can hardly do such a list justice, certainly not with only a dozen names. [[User:Sj|+sj]][[User Talk:Sj|<fontspan colorstyle="color:#ff6996;">+</fontspan>]] 05:10, 11 Aug 2004 (UTC)

=="Invitation" to work on questionable off-topic article==

Line 196 ⟶ 194:

:::::: [[Asymptotic complexity]] now redirects here again. This article is good, but it doesn't contain the word "asymptotic" at all. The [[Big O notation]] might be a better redirect. [[User:Werediver|Werediver]] ([[User talk:Werediver|talk]]) 14:44, 9 June 2021 (UTC)

::::::: Now, {{noredirect|Asymptotic complexity}} is a redirect to [[Computational complexity#Asymptotic complexity]]. [[User:D.Lazard|D.Lazard]] ([[User talk:D.Lazard|talk]]) 14:58, 9 June 2021 (UTC)

::::::: As [[Context of computational complexity]] is a content fork of [[Computational complexity]], and is a unplausible research term, I have redirected it to [[Computational complexity]]. Also, I have redirected {{noredirect|Bit complexity}} to the same article, which I have edited for adding details to the definition of ''bit complexity''. [[User:D.Lazard|D.Lazard]] ([[User talk:D.Lazard|talk]]) 18:11, 9 June 2021 (UTC)

== worst-case analysis ==

Line 468 ⟶ 467:

== Supertasks ==

The [[supertask]] article has a note at the top stating "''For the computer science term, see [[Computational complexity theory]].''" Is that note accurate? Taken literally, it is not, as the term ''supertask'' cannot actually be found anywhere in this article. But I ask here because readers of this talk page may know if that characterization is somehow appropriate. Regards, [[User:Orange Suede Sofa|<span style="font-variant:small-caps">[[User:Orange Suede Sofa|<font; color=":DarkGreen;">Orange Suede Sofa</fontspan>]]</span> ([[User talk:Orange Suede Sofa|talk]]) 07:11, 23 October 2012 (UTC)

== Computational complexity ==