Talk:Computational complexity: Difference between revisions

Revision as of 12:48, 5 September 2019

Latest revision as of 23:58, 8 March 2024

(4 intermediate revisions by 4 users not shown)

Line 1:

{{WikiProject banner shell|class=C|

{{WikiProjectBannerShell|1=

{{WikiProject Computing|class=C|importance=Top}}

{{WikiProject Computer science|class=C|importance=top}}

{{mathsWikiProject rating|class=CMathematics|importance=high|field=discrete}}

}}

{{annual readership|scale=log}}

Line 28:

Somebody could argue that this article is a fork of [[Computational complexity theory]] or of [[Analysis of algorithms]]. This is not the case; these two articles should be linked as {{tl|main article}} in sections of [[Computational complexity]], but none is a convenient target for linking "complexity" in a sentence such as "the complexity of integer multiplication is <math>O(n^2)</math> with the elementary algorithms and <math>O(n\log n \log \log n)</math> with the best known algorithm. [[User:D.Lazard|D.Lazard]] ([[User talk:D.Lazard|talk]]) 17:37, 3 December 2017 (UTC)

== Magical simbols ==

Deciphering mathematics as the magical simbols ready to discover and decipher.

After the motivation the Computentional complexity book spread the space, time complexity,exities and topics. Moreover there are mentioned there computing models and its efficiency.

All this topics get the close to having level a at mathematics and entry to the famous imperial college in Londond or other institutions. [[User:Bezos260387|Bezos260387]] ([[User talk:Bezos260387|talk]]) 12:48, 5 September 2019 (UTC)