https://deepai.org/publication/properly-learning-decision-trees-in-almost-polynomial-time
09/01/21 - We give an n^O(loglog n)-time membership query algorithm for properly and agnostically learning decision trees under the uniform d...
decision treespolynomial timeproperlylearningalmost
https://arxiv.org/abs/1805.11489
Abstract page for arXiv paper 1805.11489: Recovering short secret keys of RLCE in polynomial time
recoveringshortsecretkeysrlce
https://deepai.org/publication/minimum-height-drawings-of-ordered-trees-in-polynomial-time-homotopy-height-of-tree-duals
03/16/22 - We consider drawings of graphs in the plane in which vertices are assigned distinct points in the plane and edges are drawn as sim...
polynomial timeminimumheightdrawingsordered