A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM.

Esther Ezra Micha Sharir

Published in: SoCG (2017)

Keyphrases

decision trees
worst case
computational complexity
linear functions
objective function
upper bound
database
complexity bounds
pairwise
decision tree induction
decision table
constrained minimization
classification models
error bounds
naive bayes
text classification
similarity measure
neural network
data sets