Before revision:  The Meataxe algorithm, a popular one known for computing such a decomposition , runs in O(n^{ 6(d+1) }) time where n is the size of the input module .
After revision:  The Meataxe algorithm, a popular one known for computing such a decomposition runs in O(n^{ 6(d+1) }) time where n is the size of the input module .