


default search action
ACM SIGSAM Bulletin, Volume 27
Volume 27, Number 1, January 1993
- Ivan I. Shevchenko, Nikolay N. Vasiliev:

Algorithms of numeric deduction of analytical expressions. 1-3 - Jeffrey O. Shallit, Jonathan Sorenson

:
A binary algorithm for the Jacobi symbol. 4-11 - Antonio Montes:

Numerical conditioning of a system of algebraic equations with a finite number of solutions using Gröbner bases. 12-19 - Wolfram Koepf:

Examples for the algorithmic calculation of formal Puisieux, Laurent and power series. 20-32
Volume 27, Number 2, April 1993
- Bruno Salvy:

Efficient programming in Maple: a case study. 1-12 - Michael B. Monagan:

von zur Gathen's factorization challenge. 13-18 - Albrecht Beutelspacher, Johannes Ueberberg:

Symbolic incidence geometry proposal for doing geometry with a computer (Part 1 of 2). 19-29
Volume 27, Number 3, September 1993
- Susan Landau:

Finding maximal subfields. 4-8 - Albrecht Beutelspacher, Johannes Ueberberg:

Symbolic incidence geometry proposal for doing geometry with a computer (Part 2 of 2). 9-24
Volume 27, Number 4, December 1993
- Erich L. Kaltofen

:
Direct proof of a theorem by Kalkbrener, Sweedler, and Taylor. 2 - Manfred Göbel:

Using Buchbergers algorithm in invariant theory. 3-9 - Henry G. Baker:

Sparse polynomials and linear logic. 10-14 - Robert M. Corless

:
What is a solution of an ODE? 15-19

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














