Time and space complexity of deterministic and nondeterministic decision trees
From MaRDI portal
Publication:2679423
Cites work
- A combinatorial problem; stability and order for models and theories in infinitary languages
- A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem
- A SAT-based approach to learn explainable decision sets
- An exponential lower bound on the size of algebraic decision trees for MAX
- Combinatorial machine learning. A rough set approach.
- Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity Local Approach
- Complexity measures and decision tree complexity: a survey.
- Data Mining with Decision Trees
- Decision and inhibitory trees and rules for decision tables with many-valued decisions
- Decision tree complexity and Betti numbers
- Foundations of Rule Learning
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 1256662 (Why is no real title available?)
- scientific article; zbMATH DE number 1306858 (Why is no real title available?)
- scientific article; zbMATH DE number 708667 (Why is no real title available?)
- scientific article; zbMATH DE number 741345 (Why is no real title available?)
- scientific article; zbMATH DE number 2064222 (Why is no real title available?)
- scientific article; zbMATH DE number 754448 (Why is no real title available?)
- scientific article; zbMATH DE number 3797499 (Why is no real title available?)
- scientific article; zbMATH DE number 845932 (Why is no real title available?)
- scientific article; zbMATH DE number 7625179 (Why is no real title available?)
- scientific article; zbMATH DE number 3393931 (Why is no real title available?)
- Independence number and the complexity of families of sets
- Information systems theoretical foundations
- Logical analysis of numerical data
- Lower bounds for algebraic decision trees
- Multidimensional Searching Problems
- On the complexity of computations under varying sets of primitives
- On the density of families of sets
- On topological lower bounds for algebraic computation trees
- One-way functions and the nonisomorphism of NP-complete sets
- Optimal classification trees
- Partial covers, reducts and decision rules in rough sets. Theory and applications
- Query complexity, or why is it difficult to separate NP^ A coNP^ A from P^ A by random oracles A?
- Recent advances in the theory and practice of logical analysis of data
- Rudiments of rough sets
- Three approaches to data analysis. Test theory, rough sets and logical analysis of data.
- Time-space trade-offs for branching programs
- Time-space tradeoffs for branching programs
- Totally optimal decision trees for Boolean functions
- Transactions on Rough Sets III
Cited in
(4)
This page was built for publication: Time and space complexity of deterministic and nondeterministic decision trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2679423)
