Susanne Schmitt
Max Planck Society
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Susanne Schmitt.
Algorithmica | 2009
Christoph Burnikel; Stefan Funke; Kurt Mehlhorn; Stefan Schirra; Susanne Schmitt
Abstract Real algebraic expressions are expressions whose leaves are integers and whose internal nodes are additions, subtractions, multiplications, divisions, k-th root operations for integral k, and taking roots of polynomials whose coefficients are given by the values of subexpressions. We consider the sign computation of real algebraic expressions, a task vital for the implementation of geometric algorithms. We prove a new separation bound for real algebraic expressions and compare it analytically and experimentally with previous bounds. The bound is used in the sign test of the number type leda::real.
european symposium on algorithms | 2005
Eric Berberich; Arno Eigenwillig; Michael Hemmer; Susan Hert; Lutz Kettner; Kurt Mehlhorn; Joachim Reichel; Susanne Schmitt; Elmar Schömer; Nicola Wolpert
We present the first release of the Exacus C++ libraries. We aim for systematic support of non-linear geometry in software libraries. Our goals are efficiency, correctness, completeness, clarity of the design, modularity, flexibility, and ease of use. We present the generic design and structure of the libraries, which currently compute arrangements of curves and curve segments of low algebraic degree, and boolean operations on polygons bounded by such segments.
Archive | 2003
Susanne Schmitt; Horst G. Zimmer
The basics of the theory of elliptic curves should be known to everybody, be he (or she) a mathematician or a computer scientist. Especially everybody concerned with cryptography should know the elements of this theory. The purpose of the present textbook is to give an elementary introduction to elliptic curves. Since this branch of number theory is particularly accessible to computer-assisted calculations, the authors make use of it by approaching the theory under a computational point of view. Specifically, the computer-algebra package SIMATH can be applied on several occasions. However, the book can be read also by those not interested in any computations. Of course, the theory of elliptic curves is very comprehensive and becomes correspondingly sophisticated. That is why the authors made a choice of the topics treated. Topics covered include the determination of torsion groups, computations regarding the Mordell-Weil group, height calculations, S-integral points. The contents is kept as elementary as possible. In this way it becomes obvious in which respect the book differs from the numerous textbooks on elliptic curves nowadays available.
computer algebra in scientific computing | 2005
Susanne Schmitt
The LEDA number type real is extended by the diamond operator, which allows to compute exactly with real algebraic numbers given as roots of polynomials. The coefficients of these polynomials can be arbitrary real algebraic numbers. The implementation is presented and experiments with two other existing implementations of real algebraic numbers (CORE, EXACUS) are done.
Untitled Event | 2005
Arno Eigenwillig; Lutz Kettner; Werner Krandick; Kurt Mehlhorn; Susanne Schmitt; Nicola Wolpert; Viktor G. Ganzha; Ernst W. Mayr; Evenii V. Vorozhtsov
Untitled Event | 2005
Eric Berberich; Arno Eigenwillig; Michael Hemmer; Susan Hert; Lutz Kettner; Kurt Mehlhorn; Joachim Reichel; Susanne Schmitt; Elmar Schömer; Nicola Wolpert; Gerth Stølting Brodal; Stefano Leonardi
symposium on discrete algorithms | 2005
Stefan Funke; Christian Klein; Kurt Mehlhorn; Susanne Schmitt
Archive | 2006
Bernard Mourrain; Sylvain Pion; Susanne Schmitt; Jean-Pierre Técourt; Elias P. Tsigaridas; Nicola Wolpert
Archive | 2004
Stefan Funke; Kurt Mehlhorn; Susanne Schmitt; Christoph Burnikel; Rudolf Fleischer; Stefan Schirra
Archive | 2003
Susanne Schmitt