Asymptotic computational complexity
id:
asymptotic-computational-complexity-240-7315202
title:
Asymptotic computational complexity
text:
In computational complexity theory, asymptotic computational complexity is the usage of asymptotic analysis for the estimation of computational complexity of algorithms and computational problems, commonly associated with the usage of the big O notation.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Asymptotic_computational_complexity
date created:
date modified:
2020-12-13T01:05:42Z
main entity:
{"identifier":"Q13414364","url":"https://www.wikidata.org/entity/Q13414364"}
image:
fields total:
13
integrity:
13