The following pages link to Termination of polynomial loops (Q2233526):
Displaying 10 items.
- A comparison of methods for terminating polynomial iterations (Q1113616) (← links)
- Symbolic termination analysis of solvable loops (Q1930157) (← links)
- Synthesizing ranking functions for loop programs via SVM (Q2084940) (← links)
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops (Q2104561) (← links)
- A second-order formulation of non-termination (Q2353638) (← links)
- Algorithms with polynomial interpretation termination proof (Q2740985) (← links)
- Termination analysis of nonlinear loops over closed and bounded connected domain (Q2824412) (← links)
- (Q5028427) (← links)
- A Calculus for Modular Loop Acceleration (Q5039502) (← links)
- Invariant relations for affine loops (Q6592111) (← links)
