Automated proving of exponent polynomial inequalities

zbMATH Open1399.68188MaRDI QIDQ3175733FDOQ3175733

Authors: Zhong Liu, Shiping Chen 

Publication date: 18 July 2018

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
• Publication:5751975

zbMATH Keywords

automated provingreadable prooflower limit polynomialupper limit polynomialexponent polynomial inequalities

Mathematics Subject Classification ID

Inequalities for trigonometric functions and polynomials (26D05)

Cited In (7)

• The proofs of homogeneous polynomials inequalities by incremental resolution (partition) method
• Reachability analysis of linear systems
• Title not available (Why is that?)
• Automated proving for a class of transcendental-polynomial inequalities
• Title not available (Why is that?)
• Automated proof of mixed trigonometric-polynomial inequalities
• One method for proving some classes of exponential analytical inequalities

Uses Software

• Maple
• BOTTEMA

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)