摘要
By means of dimension-decreasing method and cell-decomposition,a practical algorithm is proposed to decide the positivity of a certain class of symmetric polynomials,the numbers of whose elements are variable.This is a class of mechanically decidable problems beyond Tarski model.To implement the algorithm,a program nprove written in maple is developed which can decide the positivity of these polynomials rapidly.
By means of dimension-decreasing method and cell-decomposition,a practical algorithm is proposed to decide the positivity of a certain class of symmetric polynomials,the numbers of whose elements are variable.This is a class of mechanically decidable problems beyond Tarski model.To im- plement the algorithm,a program nprove written in maple is developed which can decide the positivity of these polynomials rapidly.
基金
This work was partially supported by China 973 Project NKBRPC (Grant No.2004CB318003)
the Knowledge Innovation Program of the Chinese Academy of Sciences (Grant No.KJCX2-YW-S02)
