| 作成者 |
|
|
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
| 関連URI |
|
| 概要 |
Quantifier Elimination (QE) in the domain of an algebraically closed field is much simpler than that of a real closed field. We can construct a QE algorithm using only GCD computations of (parametric)... unary polynomials. Though a more sophisticated QE algorithm using Gröbner bases computations is implemented in the computer algebra system Mathematica, it is basically based on GCD computations of (parametric) unary polynomials. We propose two algorithms, one is an improvement of the algorithm of Mathematica based on the result of [1], the another one is an algorithm based on computations of comprehensive Gröbner systems.続きを見る
|
Mendeley出力
