Sciweavers

CASC
2006
Springer
100views Mathematics» more  CASC 2006»
15 years 20 days ago
Reducing Computational Costs in the Basic Perturbation Lemma
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
Ainhoa Berciano, María José Jim&eacu...
79
Voted
AISC
2004
Springer
15 years 20 days ago
Four Approaches to Automated Reasoning with Differential Algebraic Structures
While implementing a proof for the Basic Perturbation Lemma (a central result in Homological Algebra) in the theorem prover Isabelle one faces problems such as the implementation o...
Jesús Aransay, Clemens Ballarin, Julio Rubi...