An Algorithm for Sums of Squares of a Class of Positive Semi-Definite Polynomials
一类半正定多项式的配平方和算法

Based on Newton polytope technology, by means of the relation of points in Newton polytope, an algorithm is presented for representing a class of positive semi-definite polynomials as sums of squares. It's is very effective for a class of sparse polynomials. This algorithm improves the efficiency of sums ofsquares of real polynomial and advances the Automated Production ofreadable proof of a class of algebraic inequalities. In addition, asufficient condition is derived to determine that a givenpolynomial cannot be represented as a sum of squares.