#### Filter Results:

- Full text PDF available (20)

#### Publication Year

1989

2017

- This year (1)
- Last five years (8)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Gert-Martin Greuel, Gerhard Pfister, Hans Schönemann
- ACM Comm. Computer Algebra
- 2008

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

Article history: Received 14 October 2011 Accepted 23 March 2012 Available online 4 July 2012

- G C Pfister, J C Puffer, B J Maron
- JAMA
- 2000

CONTEXT
Sudden death in young competitive athletes due to unsuspected cardiovascular disease has heightened interest in preparticipation screening.
OBJECTIVE
To assess screening practices for detecting potentially lethal cardiovascular diseases in college-aged student-athletes.
DESIGN, SETTING, AND PARTICIPANTS
A total of 1110 National Collegiate… (More)

- Daniel J. Bates, Wolfram Decker, +5 authors Charles W. Wampler
- 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)

- Gert-Martin Greuel, Gerhard Pfister, Hans Schönemann
- The Computer Science Journal of Moldova
- 1997

- 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)

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