Content deleted Content added
→Computer science: new section Tags: Reverted Mobile edit Mobile web edit |
m Reverted 1 edit by 2409:4070:4D81:DBD3:E0B5:FF94:8309:E46F (talk) to last revision by Iridescent |
||
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)
|