期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A class of mechanically decidable problems beyond Tarski's model 被引量:3
1
作者 Lu YANG~(1,2) Yong FENG~(1+) Yong YAO~1 1 Laboratory for Automated Reasoning and Programming,Chengdu Institute of Computer Applications,Chinese Academy of Sciences,Chengdu 610041,China 2 Institute of Theoretical Computing,East China Normal University,Shanghai 200062,China 《Science China Mathematics》 SCIE 2007年第11期1611-1620,共10页
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 ... 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. 展开更多
关键词 symmetric polynomial inequality cell-decomposition tarski's sentence tarski's model mechanically decidable problem
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部