… Given a vertex-weighted tree T, the split of an edge xy in T is min{sx,sy} where sx (… a multiset
of splits S, we consider the problem of constructing a tree on V whose splits correspond to S. …

… consider the problem of constructing a tree on V whose splits correspond to S . The problem
… of splits of T . We consider the problem of reconstructing a tree with a given multiset of splits …

… Results for reconstruction with a known tree. We consider the problem of tree reconstruction
… Related work: complexity of reconstruction on trees. Our work follows a line of previous work …

… complexity bounds hold in general below the celebrated Kesten-Stigum bound. In this work,
we prove that this is indeed the case for low degree … for lowdegree polynomial reconstruction…

… Next we show that any sufficient large tree are not likely to occur, which implies … complexity
becoming O(logd log n). We also show how to achieve a more refined directed degree split in …

… Since decision tree complexity is well known to be related to … for decision tree induction via
a higher-order splitting criterion… Beyond the low-degree algorithm: mixtures of subcubes and …

… query complexities: Theorem 1 (Tester for decision tree complexity… that is the sign of a
low-degree polynomial.As for proper learning … tree induction via a higher-order splitting criterion. In …

… The difficulty of meeting geometric and topological criteria … , we compute a balanced
binary tree. As a consequence, the … This algorithm splits the hole recursively until it gets holes …

… The number of vertices of low degree not exclusively adjacent to high degree vertices is
then bounded by k ( k + 1 ) . When constructing a kernel for Max Leaf IT (internal), however, it is …

… If no split node appears, we have two subcases. If the ith bit … exist other connected subgraphs
of “low-degree” vertices. Let U be … [34] MA Steel, The complexity of reconstructing trees from …