Highly Influential

One of the challenging problems regarding learning decision trees is whether decision trees over the domain Z~, in which each internal node is labeled by a module function axi(mod N) for some i E (1 .... ,n), are efficiently learnable with equivalence and membership queries [5]. Given any decision tree T, let s be the number of its leaf nodes. Let N = p~l… (More)