Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,930,594 papers from all fields of science
Search
Sign In
Create Free Account
Decision tree model
Known as:
Query complexity
, Decision tree complexity
, Quantum query complexity
Expand
In computational complexity and communication complexity theories the decision tree model is the model of computation or communication in which an…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
Analysis of algorithms
Binary tree
Certificate (complexity)
Clique problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Parameterized Query Complexity of Hitting Set using Stability of Sunflowers
Arijit Bishnu
,
Arijit Ghosh
,
Sudeshna Kolay
,
Gopinath Mishra
,
Saket Saurabh
International Symposium on Algorithms and…
2018
Corpus ID: 49870287
In this paper, we study the query complexity of parameterized decision and optimization versions of {\sc Hitting-Set}, {\sc…
Expand
2016
2016
Clustering Via Crowdsourcing
A. Mazumdar
,
B. Saha
arXiv.org
2016
Corpus ID: 16934458
In recent years, crowdsourcing, aka human aided computation has emerged as an effective platform for solving problems that are…
Expand
2014
2014
Exact query complexity of some special classes of Boolean functions
A. Ambainis
,
J. Gruska
,
Shenggen Zheng
arXiv.org
2014
Corpus ID: 26363016
2008
2008
Improved C-Fuzzy Decision Tree for Intrusion Detection
K. Makkithaya
,
N. S. Reddy
,
U. D. Acharya
2008
Corpus ID: 15596825
As the number of networked computers grows,intrusion detection is an essential component in keeping networks secure. Various…
Expand
2007
2007
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
H. Barnum
Algorithms and Complexity for Continuous Problems
2007
Corpus ID: 7939764
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical “black box…
Expand
2000
2000
Computing a maximal depth point in the plane
S. Langerman
,
W. Steiger
2000
Corpus ID: 117141145
Given a set S = {P1, . . . , Pn} of n points in R , the depth of a point Q ∈ R is the minimum number of points of S that must be…
Expand
1998
1998
Discourse Parsing: A Decision Tree Approach
Tadashi Nomoto
,
Yuji Matsumoto
VLC@COLING/ACL
1998
Corpus ID: 6388657
The paper presents a new statistical method, for parsing discourse. A parse of discourse is defined as a set of semantic…
Expand
1996
1996
Binary linear decision tree with genetic algorithm
Bing-Bing Chai
,
X. Zhuang
,
Yunxin Zhao
,
J. Sklansky
Proceedings of 13th International Conference on…
1996
Corpus ID: 26499235
A linear decision binary tree structure is proposed in constructing piecewise linear classifiers with the genetic algorithm (GA…
Expand
1993
1993
On the query complexity of learning
Sampath Kannan
Annual Conference Computational Learning Theory
1993
Corpus ID: 17367897
We consider the problem of learning parametrized concept classes with membership and equivalence queries. If C. is the concept…
Expand
1975
1975
On the decision tree complexity of the shortest path problems
M. Fredman
16th Annual Symposium on Foundations of Computer…
1975
Corpus ID: 2667107
In this paper we present two new bounds on the decision tree complexity of the all-pairs shortest path problem, one for the worst…
Expand