Testing positiveness of polynomials

DOI10.1023/A:1005983105493MaRDI QIDQ1272602zbMATH OpenOpenAlexFDO

Authors Hoon Hong, Dalibor Jakuš

Publication date 29 June 1999

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1005983105493

zbMATH Keywords

positiveness of polynomialsterm rewrite systemstermination proofs

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1318515
• Testing polynomials
• Positivity conditions for polynomials
• scientific article; zbMATH DE number 1490029
• Deciding eventual positivity of polynomials
• Positive values of polynomials
• Test polynomials
• On algorithms testing positivity of real symmetric polynomials
• Positive polynomials and polynomial inequalities
• scientific article; zbMATH DE number 2219805

Cited in

(28)

• Increasing interpretations
• Test polynomials
• Improved bounds on absolute positiveness of multivariate polynomials
• Real or natural number interpretation and their effect on complexity
• A complete superposition calculus for primal grammars
• A class of mechanically decidable problems beyond Tarski's model
• Weighted difference substitutions and nonnegativity decision of forms
• Maximal Termination
• Proving Termination of Integer Term Rewriting
• scientific article; zbMATH DE number 1490029 (Why is no real title available?)
• A fast numerical test of multivariate polynomial positiveness with applications.
• Size-based termination of higher-order rewriting
• Algorithms for positive polynomial approximation
• Efficient solution of a class of quantified constraints with quantifier prefix exists-forall
• Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations
• A new algorithm for proving global asymptotic stability of rational difference equations
• Automatic proofs of termination with elementary interpretations
• A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
• Polynomials over the reals in proofs of termination : from theory to practice
• Termination Analysis of Logic Programs Based on Dependency Graphs
• Search Techniques for Rational Polynomial Orders
• Increasing Interpretations
• Monotonicity criteria for polynomial interpretations over the naturals
• On complexity bounds and confluence of parallel term rewriting
• Mechanically proving termination using polynomial interpretations
• Tyrolean termination tool: techniques and features
• Mechanizing and improving dependency pairs
• Bounds on absolute positiveness of multivariate polynomials

This page was built for publication: Testing positiveness of polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1272602)