Similar Items: 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
- On Sampling Lower Bounds for Polynomials
- Polynomial-time completion of phylogenetic tree sets
- Strongly Refuting Random CSP without Literals
- Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference
- Toward a Characterization of Simulation Between Arithmetic Theories