Polynomial Constants Are Decidable
No abstract available.
Related papers
- On Deciding Constant Runtime of Linear Loops TACAS 2026
- Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable APLAS 2009
- Parameterized Verification of Synchronization in Constrained Reconfigurable Broadcast Networks TACAS 2018
- Simple Linear Loops: Algebraic Invariants and Applications POPL 2025
- Isomorphisms of generic recursive polynomial types POPL 2004
- Algorithmic Aspects of Type Inference with Subtypes POPL 1992
- Integer Reasoning Modulo Different Constants in SMT CAV 2025
- A General Noninterference Policy for Polynomial Time POPL 2023