Yo, we ultimately got a O(1) solution to the travelling salesman problem. No more super computers no complicated graph. This is how you can do it:

O(1) solution of travelling solution problem
O(1) solution of travelling salesman problem

So get your school assignments done.


3 thoughts on “O(1) solution to travelling salesman problem

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s