Skip to search formSkip to main contentSkip to account menu

Decision tree model

Known as: Query complexity, Decision tree complexity, Quantum query complexity 
In computational complexity and communication complexity theories the decision tree model is the model of computation or communication in which an… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
Analysis of algorithmsBinary treeCertificate (complexity)Clique problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
On the Query Complexity of Selecting Few Minimal Sets
Propositional Satisfiability (SAT) solvers are routinely used for solving many function problems. A natural question that has… 
2013
2013
Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
This paper discusses provable security of two types of cascade encryptions. The first construction CE l , called l-cascade… 
2010
2010
On Testing Computability by Small Width OBDDs
  • Oded Goldreich
  • Electron. Colloquium Comput. Complex.
  • 2010
  • Corpus ID: 1266857
We take another step in the study of the testability of smallwidth OBDDs, initiated by Ron and Tsur (Random'09). That is, we… 
2009
2009
Orthogonal Range Reporting in Three and Higher Dimensions
In orthogonal range reporting we are to preprocess N points in d-dimensional space so that the points inside a d-dimensional axis… 
Highly Cited
2007
Highly Cited
2007
Quantum Algorithms for Hidden Nonlinear Structures
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonAbelian hidden… 
Highly Cited
2007
Highly Cited
2007
Software quality estimation with limited fault data: a semi-supervised learning perspective
We addresses the important problem of software quality analysis when there is limited software fault or fault-proneness data. A… 
2004
2004
Effects of query complexity and learning on novice user query performance with conceptual and logical database interfaces
Users see the database interface as the database system. A good interface enables them to formulate queries better. The semantics… 
2002
2002
Minimizing the Average Query Complexity of Learning Monotone Boolean Functions
This paper addresses the problem of completely reconstructing deterministic monotone Boolean functions via membership queries… 
1996
1996
Discovery of Relevant New Features by Generating Non-Linear Decision Trees
Most decision tree algorithms using selective induction focus on univariate, i.e. axis-parallel tests at each internal node of a… 
Highly Cited
1995
Highly Cited
1995
Generalized teaching dimensions and the query complexity of learning
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)