Sciweavers

3454 search results - page 80 / 691
» Modern computer algebra
Sort
View
FROCOS
2000
Springer
15 years 9 months ago
Non-Trivial Symbolic Computations in Proof Planning
Abstract. We discuss a pragmatic approach to integrate computer algebra into proof planning. It is based on the idea to separate computation and veri cation and can thereby exploit...
Volker Sorge
DISCO
1993
114views Hardware» more  DISCO 1993»
15 years 10 months ago
Gauss: A Parameterized Domain of Computation System with Support for Signature Functions
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
Michael B. Monagan
COMPGEOM
2000
ACM
15 years 10 months ago
Look - a Lazy Object-Oriented Kernel for geometric computation
In this paper we describe and discuss a new kernel design for geometric computation in the plane. It combines different kinds of floating-point filter techniques and a lazy eval...
Stefan Funke, Kurt Mehlhorn
COMPGEOM
2004
ACM
15 years 9 months ago
Complete, exact, and efficient computations with cubic curves
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We d...
Arno Eigenwillig, Lutz Kettner, Elmar Schömer...
COMGEO
2006
ACM
15 years 6 months ago
An exact and efficient approach for computing a cell in an arrangement of quadrics
We present an approach for the exact and efficient computation of a cell in an arrangement of quadric surfaces. All calculations are based on exact rational algebraic methods and ...
Elmar Schömer, Nicola Wolpert