Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:21706618n
Noun Concept
Categories: Articles with short description, Time, Analysis of algorithms, Computational resources, Computational complexity theory
EN
time complexity  Algorithmic time complexity  computation time  computational time  constant time
EN
In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Wikipedia
Definitions
Relations
Sources
EN
In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Wikipedia
Amount of computer time it takes to run an algorithm. Wikipedia Disambiguation
Estimate of time taken for running an algorithm Wikidata
Amount of time. Wiktionary (translation)
The amount of time an algorithm requires to run, as a function of the amount of input, measured in such a way as to ignore constant terms and multiplication by constant terms. Wiktionary
IS A
function
computational complexity
HAS KIND
polynomial time
DIFFERENT FROM
space complexity
FACET OF
algorithm
Wikipedia
EN
time complexity
Wikidata
EN
time complexity
Wiktionary
EN
time complexity
Wikipedia Redirections
EN
Algorithmic time complexity, computation time, computational time, constant time, Cubic time, double exponential time, exponential algorithm, exponential time, fast algorithms, linear-time, Linear-time algorithm, linear time, Linear time agorithm, Linearithm, linearithmic, linearithmic function, linearithmic time, logarithmic time, N log n, Nlogn, polylogarithmic time, polynomial-time, polynomial-time algorithm, Polynomial-time solution, Polynomial-time solutions, polynomial time, polynomial time algorithm, Polytime, quadratic time, quasi-polynomial time, quasilinear time, Run-time complexity, strongly polynomial, strongly polynomial time, sub-exponential time, sub-linear time, SUBEXP, Subexponential time, Sublinear-time, sublinear algorithm, sublinear time, sublinear time algorithm, subquadratic time, super-polynomial time, superpolynomial, time complexities, weakly polynomial, Weakly polynomial time algorithm

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License