Pages that link to "Item:Q5437651"
From MaRDI portal
The following pages link to Recurrence with affine level mappings is P-time decidable for CLP (Q5437651):
Displaying 4 items.
- A new look at the automatic synthesis of linear ranking functions (Q714505) (← links)
- On the Termination of Integer Loops (Q2891402) (← links)
- Dependency Triples for Improving Termination Analysis of Logic Programs with Cut (Q3003493) (← links)
- Ranking Functions for Linear-Constraint Loops (Q5501930) (← links)
