Pages that link to "Item:Q5505493"
From MaRDI portal
The following pages link to Search Techniques for Rational Polynomial Orders (Q5505493):
Displaying 10 items.
- SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
- KBO orientability (Q846165) (← links)
- Optimal search for rationals (Q1007565) (← links)
- Increasing interpretations (Q1044231) (← links)
- Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- (Q3533259) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- Query order in the polynomial hierarchy (Q5055937) (← links)
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (Q5191109) (← links)