Similar Items: Tight Polynomial Worst-Case Bounds for Loop Programs
- Tight Polynomial Bounds for Loop Programs in Polynomial Space
- Worst-Case Input Generation for Concurrent Programs under Non-Monotone Resource Metrics
- Nearly-Tight Bounds for Zonotope Containment and Beyond
- Polygraphic programs and polynomial-time functions
- On Sampling Lower Bounds for Polynomials
- Tightly-Secure Simulation-Sound Quasi-Adaptive NIZK Arguments