🚀 🐍 Optimizes Python bytecode calculating linear recurrences, reducing the time complexity from O(n) to O(log n)
-
Updated
Feb 11, 2022 - Python
🚀 🐍 Optimizes Python bytecode calculating linear recurrences, reducing the time complexity from O(n) to O(log n)
Add a description, image, and links to the matrix-exponentiation topic page so that developers can more easily learn about it.
To associate your repository with the matrix-exponentiation topic, visit your repo's landing page and select "manage topics."