Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03626490n
Noun Concept
Categories: Computational complexity theory, long volume value, Computational fields of study, Articles with short description
EN
computational complexity theory  intractable problem  asymptotic complexity  Calculation complexity  Complexity of Algorithms
EN
In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. Wikipedia
Definitions
Relations
Sources
EN
In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. Wikipedia
A field in theoretical computer science and mathematics Wikipedia Disambiguation
Theoretical computer science and mathematics theory that classifies problems according to their inherent difficulty, and relates those classes to each other Wikidata
A branch of the theory of computation in computer science, investigates the problems related to the amounts of resources required for the execution of algorithms OmegaWiki
A problem that can be solved, but not fast enough for the solution to be usable. OmegaWiki
IS A
academic discipline
computability theory
HAS PART
complexity class
PART OF
mathematics
theoretical computer science
HAS KIND
analysis of algorithms
branching factor
FACET OF
algorithm
STUDIES
quantum supremacy
computational complexity
Wikipedia
EN
computational complexity theory
Wikidata
EN
computational complexity theory
OmegaWiki
EN
computational complexity theory, intractable problem
Wikipedia Redirections
EN
asymptotic complexity, Calculation complexity, Complexity of Algorithms, complexity theory (computation), Complexity theory in computation, computational complexity analysis, computational intractability, Computationally infeasible, computationally intractable, Continuous complexity theory, feasible computability, Feasible computation, hierarchy theorem, History of computational complexity theory, intractability (complexity), intractable problem, Intractableness, Intractably, Levin reduction, Order of complexity, Order of computation, Space complexity theory
Wikidata Alias
EN
complexity theory

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