64 search results - page 4 / 13 » A field-theory motivated approach to symbolic computer algeb... |
ISSAC
2005
Springer
14 years 26 days ago
2005
Springer
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
ECEASST
2010
13 years 4 months ago
2010
In this talk we will present a new approach to deal with attributed graphs and attributed graph transformation. The approach is based on working with what we call symbolic graphs, ...
CASC
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We describe a symbolic framework for treating linear boundary problems with a generic implementation in the Theorema system. For ordinary differential equations, the ope...
AMAI
2007
Springer
13 years 7 months ago
2007
Springer
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alo...