Polynomial algorithms with huge constants (e.g., O(n^100)) are theoretically tractable but practical...
This proposition has not been edited since the history system was added.