Do you think there's any hope of finding a practical algorithm for USTON that runs in logarithmic space? Reingold's algorithm needs O(n^64^32) time(!!!)