Similar Items: On Sampling Lower Bounds for Polynomials
- Lower Bounds for Approximate Sign Rank
- From Gödel incompleteness to the consistency of circuit lower bounds
- Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
- Polynomial-time completion of phylogenetic tree sets
- 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