#### Filter Results:

#### Publication Year

1989

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- G. M. Greuel, G. Pfister, H. Schönemann
- ACCA
- 2009

What is SINGULAR? SINGULAR is a specialized computer algebra system for polynomial computations with emphasize on the needs of commuta-tive algebra, algebraic geometry, and singularity theory. SINGULAR's main computational objects are polynomials, ideals and modules over a large variety of rings, including important non-commutative rings. SINGULAR features… (More)

- Nazeran Idrees, Gerhard Pfister, Stefan Steidel
- J. Symb. Comput.
- 2011

- Janko Böhm, Wolfram Decker, Santiago Laplagne, Gerhard Pfister, Andreas Steenpaß, Stefan Steidel
- J. Symb. Comput.
- 2013

- Daniel J. Bates, Wolfram Decker, Jonathan D. Hauenstein, Chris Peterson, Gerhard Pfister, Frank-Olaf Schreyer +2 others
- Applied Mathematics and Computation
- 2014

Systems of polynomial equations arise throughout mathematics, engineering, and the sciences. It is therefore a fundamental problem both in mathematics and in application areas to find the solution sets of polynomial systems. The focus of this paper is to compare two fundamentally different approaches to computing and representing the solutions of polynomial… (More)

- G.-M. Greuel, G. Pfister, H. Schönemann
- SIGS
- 1997

The poster reflects the current but experimental state of parallelism in MuPAD 1. This includes the parallel language constructs, some results obtained by using the parallel statements of the MuPAD language, the concepl; of a parallel source code debugger for the MuPAD language and technical details about the current implementation. It is also important to… (More)

- Claus Hertling, Gerhard Pfister
- 1995

- Bernd Martin, Gerhard Pfister
- J. Symb. Comput.
- 1989

- Janko Böhm, Wolfram Decker, Claus Fieker, Gerhard Pfister
- Math. Comput.
- 2015

A standard method for finding a rational number from its values modulo a collection of primes is to determine its value modulo the product of the primes via Chinese remaindering, and then use Farey sequences for rational reconstruction. Successively enlarging the set of primes if needed, this method is guaranteed to work if we restrict ourselves to " good "… (More)

- Hubert Grassmann, Gert-Martin Greuel, Bernd Martin, Wolfgang Neumann, Gerhard Pfister, Wilfred Pohl +2 others
- Appl. Algebra Eng. Commun. Comput.
- 1996