Blackbox computation of $A_\infty$-algebras
英文摘要:
Kadeishvili's proof of the minimality theorem induces an algorithm for the inductive computation of an $A_\infty$-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_\infty$-algebra structure after a finite amount of computational work.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。