Let G be a complete directed graph with n vertices and integer edge weights in range [0,M ]. It is well known that an optimal Traveling Salesman Problem (TSP) in G can be solved in 2 time and space (all bounds are given within a polynomial factor of the input length, i.e., poly(n, logM)) and this is still the fastest known algorithm. If we allow a polynomial space only, then the best known algo...
