Similar Items: Polygraphic programs and polynomial-time functions
- Tight Polynomial Bounds for Loop Programs in Polynomial Space
- Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time
- Tight Polynomial Worst-Case Bounds for Loop Programs
- Capturing Polynomial Time using Modular Decomposition
- Polynomial Size Analysis of First-Order Shapely Functions
- A Fragment of Dependence Logic Capturing Polynomial Time