Kadeishvili's proof of theminimality theorem [T. Kadeishvili, On the homology theory of fiber spaces, Russ. Math. Surv.35:3 (1980), 231–238] induces an algorithm for the inductive computation of an A∞-algebra structure on the homology of a dg-algebra.
In this paper, we prove that for one class of dg-algebras, the resulting computation will generate a complete A∞-algebra structure after a finite amount of computational work.
© de Gruyter 2010