Automated proving of exponent polynomial inequalities

MaRDI QIDQ3175733zbMATH OpenFDO

Authors Zhong Liu, Shiping Chen

Publication date 18 July 2018

zbMATH Keywords

automated provingreadable prooflower limit polynomialupper limit polynomialexponent polynomial inequalities

Mathematics Subject Classification ID

Inequalities for trigonometric functions and polynomials (26D05)

Recommendations

• Automated proving for a class of transcendental-polynomial inequalities
• scientific article; zbMATH DE number 6719570
• Automated proof of mixed trigonometric-polynomial inequalities
• scientific article; zbMATH DE number 1745034
• scientific article; zbMATH DE number 4187140

Cited in

(7)

• The proofs of homogeneous polynomials inequalities by incremental resolution (partition) method
• Reachability analysis of linear systems
• scientific article; zbMATH DE number 6719570 (Why is no real title available?)
• Automated proving for a class of transcendental-polynomial inequalities
• scientific article; zbMATH DE number 1745034 (Why is no real title available?)
• Automated proof of mixed trigonometric-polynomial inequalities
• One method for proving some classes of exponential analytical inequalities

Describes a project that uses

Uses Software

• BOTTEMA
• Maple

This page was built for publication: Automated proving of exponent polynomial inequalities

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