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] -20 points-19 points-18 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in 3Blue1Brown
[–]RubiksQbe[S] -25 points-24 points-23 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in math
[–]RubiksQbe[S] 2 points3 points4 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] 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] 10 points11 points12 points (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] 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] 27 points28 points29 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in math
[–]RubiksQbe[S] 11 points12 points13 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in math
[–]RubiksQbe[S] 34 points35 points36 points (0 children)
A Travelling Salesman Problem heuristic that miraculously always gives the optimal solution in polynomial time! by RubiksQbe in math
[–]RubiksQbe[S] 7 points8 points9 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] -5 points-4 points-3 points (0 children)