Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00755648n
Noun Concept
Categories: Computational complexity theory
EN
asymptotic computational complexity  asymptotic complexity  asymptotic space complexity  asymptotic time complexity
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia
IS A
computational complexity
Wikipedia
EN
asymptotic computational complexity
Wikidata
EN
asymptotic computational complexity
Wikipedia Redirections
EN
asymptotic space complexity, asymptotic time complexity
Wikidata Alias
EN
asymptotic complexity

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