Similar Items: Polynomial Path Orders
- The computability path ordering
- Polynomial Size Analysis of First-Order Shapely Functions
- Capturing the polynomial hierarchy by second-order revised Krom logic
- On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories
- Tight Polynomial Bounds for Loop Programs in Polynomial Space
- Polygraphic programs and polynomial-time functions