Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01577959n
Noun Concept
Categories: Computational complexity theory, Models of computation, Decision trees
EN
decision tree model  algebraic decision tree  decision tree  decision tree complexity  Linear decision tree
EN
In computational complexity the decision tree model is the model of computation in which an algorithm is considered to be basically a decision tree, i.e., a sequence of queries or tests that are done adaptively, so the outcome of previous tests can influence the tests performed next. Wikipedia
Definitions
Sources
EN
In computational complexity the decision tree model is the model of computation in which an algorithm is considered to be basically a decision tree, i.e., a sequence of queries or tests that are done adaptively, so the outcome of previous tests can influence the tests performed next. Wikipedia
Model of computational complexity Wikidata
Wikipedia
EN
decision tree model
Wikidata
EN
Decision tree model
Wikipedia Redirections
EN
algebraic decision tree, decision tree (model), decision tree complexity, Linear decision tree, quantum query complexity, query complexity, sensitivity conjecture

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