Similar Items: Polynomial-time completion of phylogenetic tree sets
- On Sampling Lower Bounds for Polynomials
- Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs
- Relating the Computational and Logical Difficulty of Solving ODEs: From Polynomial to Discontinuous Right-Hand Sides
- Local Homophily on Bicolored Graphs is $mathbf{P}$-complete
- On the Complexity of Discounted Robust MDPs with $L_p$ Uncertainty Sets
- Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size