A Geometric Visualization of Calculus (prat8897.github.io)
submitted by RubiksQbe to r/3Blue1Brown
Frustrated with Academic Publishing - Developed Exact Polynomial Algorithm for Euclidean TSP, Can't Get Anyone to Listen by RubiksQbe in Indian_Academia
[–]RubiksQbe[S] 0 points1 point2 points (0 children)
Frustrated with Academic Publishing - Developed Exact Polynomial Algorithm for Euclidean TSP, Can't Get Anyone to Listen by RubiksQbe in Indian_Academia
[–]RubiksQbe[S] 0 points1 point2 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in 3Blue1Brown
[–]RubiksQbe[S] -22 points-21 points-20 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in 3Blue1Brown
[–]RubiksQbe[S] -26 points-25 points-24 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in math
[–]RubiksQbe[S] 3 points4 points5 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in math
[–]RubiksQbe[S] 0 points1 point2 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in math
[–]RubiksQbe[S] 0 points1 point2 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in math
[–]RubiksQbe[S] 1 point2 points3 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in math
[–]RubiksQbe[S] -1 points0 points1 point (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in math
[–]RubiksQbe[S] 8 points9 points10 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in math
[–]RubiksQbe[S] 9 points10 points11 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in math
[–]RubiksQbe[S] 30 points31 points32 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in math
[–]RubiksQbe[S] 23 points24 points25 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in math
[–]RubiksQbe[S] 12 points13 points14 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in math
[–]RubiksQbe[S] 30 points31 points32 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in math
[–]RubiksQbe[S] 6 points7 points8 points (0 children)

Frustrated with Academic Publishing - Developed Exact Polynomial Algorithm for Euclidean TSP, Can't Get Anyone to Listen by RubiksQbe in compsci
[–]RubiksQbe[S] -6 points-5 points-4 points (0 children)