Proving polynomials positive

DOI10.1007/3-540-56287-7_105MaRDI QIDQ4256647zbMATH OpenFDO

Authors Joachim Steinbach

Publication date 8 August 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-56287-7_105

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Generating polynomial orderings
• scientific article; zbMATH DE number 3905845
• Polynomials over the reals in proofs of termination : from theory to practice
• Generating polynomial orderings for termination proofs

Cited in

(6)

• Testing positiveness of polynomials
• Derivational complexity and context-sensitive Rewriting
• A complete superposition calculus for primal grammars
• Generating polynomial orderings for termination proofs
• Admissible ordering on monomials is well-founded: a constructive proof
• Mechanically proving termination using polynomial interpretations

This page was built for publication: Proving polynomials positive

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