4 ms·
Just for fun i calculated the worst-case state space for a network assuming that the average node has 150 peers -- out to 6 hops you have roughly 10^13 unique p
by ed 19y ago
Just for fun i calculated the worst-case state space for a network assuming that the average node has 150 peers -- out to 6 hops you have roughly 10^13 unique paths. Not impossible to work with, but you'd have to get pretty clever to reduce the computing time to something practical.
- danteembermage 19y agoDidn't we just see a post about a quantum computer designed to address the traveling salesman problem? Maybe that was reddit...
- eru 19y agoPretty clever? Findind the shortest path between two nodes in a graph is more or less a solved problem..