Algorithms for eliminating variables from systems of multivariate polynomials are essential tools in constructive algebra and algebraic geometry. The reason is that a number of important computational problems in these areas can be tackled by elimination techniques. In particular, elimination method
Special Issue on Application of Quantifier Elimination. Foreword of the Guest Editors
β Scribed by Hoon Hong; Richard Liska
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 113 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Equational logic is ubiquitous in computer science. It is the basis for algebraic specification, rewriting, unification, and equational programming. These techniques evolved in a many-sorted setting, where different sorts are disjoint. Joseph Goguen observed that an order-sorted equational logic mod
Galois theory is a standard topic in every algebra course. Computational and constructive methods in Galois theory have not yet attained this status. Algorithms to compute Galois groups go back as far as the nineteenth century and are described in the classical monograph of TschebotarΓΆw and Schwerd
In the last decade major steps toward an algorithmic treatment of orthogonal polynomials and special functions have been made, notably Zeilberger's brilliant extension of Gosper's algorithm on algorithmic definite hypergeometric summation. By implementations of these and other algorithms, symbolic c