Pages that link to "Item:Q1272602"
From MaRDI portal
The following pages link to Testing positiveness of polynomials (Q1272602):
Displaying 26 items.
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall (Q475420) (← links)
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Bounds on absolute positiveness of multivariate polynomials (Q972843) (← links)
- Increasing interpretations (Q1044231) (← links)
- Test polynomials (Q1973360) (← links)
- Improved bounds on absolute positiveness of multivariate polynomials (Q2188981) (← links)
- Real or natural number interpretation and their effect on complexity (Q2346989) (← links)
- A complete superposition calculus for primal grammars (Q2352496) (← links)
- A class of mechanically decidable problems beyond Tarski's model (Q2475316) (← links)
- Maximal Termination (Q3522012) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- A fast numerical test of multivariate polynomial positiveness with applications (Q4568267) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- Algorithms For Positive Polynomial Approximation (Q4620318) (← links)
- A new algorithm for proving global asymptotic stability of rational difference equations (Q4899080) (← links)
- Automatic Proofs of Termination With Elementary Interpretations (Q5170190) (← links)
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (Q5191108) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
- Search Techniques for Rational Polynomial Orders (Q5505493) (← links)
- Increasing Interpretations (Q5505499) (← links)
- Monotonicity Criteria for Polynomial Interpretations over the Naturals (Q5747787) (← links)
- On complexity bounds and confluence of parallel term rewriting (Q6622000) (← links)
