ISSAC
2001
Springer
14 years 5 months ago
2001
Springer
In this paper we present an algorithm to compute all unirational fields of transcendence degree one containing a given finite set of multivariate rational functions. In particul...
ISSAC
2001
Springer
14 years 5 months ago
2001
Springer
ISSAC
2001
Springer
14 years 5 months ago
2001
Springer
ISSAC
2001
Springer
14 years 5 months ago
2001
Springer
ISSAC
2001
Springer
14 years 5 months ago
2001
Springer
ISSAC
2001
Springer
14 years 5 months ago
2001
Springer
Maple’s evaluator, together with a feature that is usually known as the assume facility, is a combination of modules with specialised reasoning capabilities. These modules are i...
ISSAC
2001
Springer
14 years 5 months ago
2001
Springer
The multiple Barnes function, defined as a generalization of the Euler gamma function, is used in many applications of pure and applied mathematics and theoretical physics. This pa...
MPC
2010
Springer
14 years 5 months ago
2010
Springer
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
MPC
2010
Springer
14 years 5 months ago
2010
Springer
We show a new and constructive proof of the two-squares theorem, based on a somewhat unusual, but very effective, way of rewriting the so-called extended Euclid’s algorithm. Rat...
MPC
2010
Springer
14 years 5 months ago
2010
Springer