Similar Items: Polynomial Size Analysis of First-Order Shapely Functions
- Polynomial Path Orders
- On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories
- Polygraphic programs and polynomial-time functions
- Capturing the polynomial hierarchy by second-order revised Krom logic
- Typed realizability for first-order classical analysis
- Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time