Sciweavers

ISSAC
2001
Springer
87views Mathematics» more  ISSAC 2001»
14 years 3 months ago
Unirational fields of transcendence degree one and functional decomposition
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...
Jaime Gutierrez, Rosario Rubio San Miguel, David S...
ISSAC
2001
Springer
108views Mathematics» more  ISSAC 2001»
14 years 3 months ago
On computer-assisted classification of coupled integrable equations
Mikhail V. Foursov, Marc Moreno Maza
ISSAC
2001
Springer
98views Mathematics» more  ISSAC 2001»
14 years 3 months ago
Towards factoring bivariate approximate polynomials
Robert M. Corless, Mark Giesbrecht, Mark van Hoeij...
ISSAC
2001
Springer
110views Mathematics» more  ISSAC 2001»
14 years 3 months ago
Computing all factorizations in ***
Howard Cheng, George Labahn
ISSAC
2001
Springer
101views Mathematics» more  ISSAC 2001»
14 years 3 months ago
Maple's evaluation process as constraint contextual rewriting
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...
Alessandro Armando, Clemens Ballarin
ISSAC
2001
Springer
141views Mathematics» more  ISSAC 2001»
14 years 3 months ago
On the Barnes function
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...
Victor Adamchik
MPC
2010
Springer
165views Mathematics» more  MPC 2010»
14 years 3 months ago
Dependently Typed Grammars
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...
Kasper Brink, Stefan Holdermans, Andres Löh
MPC
2010
Springer
147views Mathematics» more  MPC 2010»
14 years 3 months ago
Designing an Algorithmic Proof of the Two-Squares Theorem
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...
João F. Ferreira