| 判断一类几何最值问题可解性的计算机算法 |
| |
| 引用本文： | 王绍恒,许明春.判断一类几何最值问题可解性的计算机算法[J].西南师范大学学报(自然科学版),2000,25(3):221-224. |
| |
| 作者姓名： | 王绍恒 许明春 |
| |
| 作者单位： | 1. 重庆三峡学院计算机系,重庆,404000
2. 西南师范大学数学系,重庆,400715 |
| |
| 基金项目： | 国家自然科学基金!( 198710 66)，教育部重点科学技术资助项目 |
| |
| 摘 要： | 利用Ｇａｌｏｉｓ理论讨论了一类涉及不等式的几何问题，给出了判断这类问题能否用初等方法或尺规作图法求解的计算机算法，该算法依赖于整系数多项式在有理数域上的因子分解和不可约性的判定。
|
| 关 键 词： | 几何最值 尺规作图 机器证明 几何定理 算法 |
Computer algorithm for judging the solvability of a kind of geometrical maximum or minimum |
| |
| WANG Shao-heng,XU Ming-chun.Computer algorithm for judging the solvability of a kind of geometrical maximum or minimum[J].Journal of Southwest China Normal University(Natural Science),2000,25(3):221-224. |
| |
| Authors: | WANG Shao-heng XU Ming-chun |
| |
| Abstract: | The outhors discuss a kind of geometrical problems reflated to inequation by app lying Galois'theory and give the computer algorithm which can be used to judge t he pro blems ,whether it can be solved with construction by rule and compass or by elem entary method. The algorithm depends upon decomposing integral coefficient polyn omials and distinguishing irreducible polynomials in rational field. |
| |
| Keywords: | geometrical maximum or minimum construction by ruler and compass geometrical mechanical proof by computer Galois'theory algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《西南师范大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《西南师范大学学报(自然科学版)》下载免费的PDF全文 |
