Improving the complexity of Parys' recursive algorithm.

Karoliina Lehtinen Sven Schewe Dominik Wojtczak

Published in: CoRR (2019)

Keyphrases

recursive algorithm
upper bound
hypothesis testing
computational complexity
database
space complexity
data sets
decision trees
lower bound
dynamic programming
knowledge discovery
decision problems
lower complexity
minimum mean square error