O(1) solution to travelling salesman problem

Posted on July 8, 2009 by

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.

Advertisement

About phoxis

Computer Science Graduate Student
This entry was posted in Humor. Bookmark the permalink.

3 Responses to O(1) solution to travelling salesman problem

  2. Sourav says:
    July 23, 2009 at 7:59 am

    cool

    Reply
  3. Mohit says:
    May 2, 2011 at 7:57 am

    Kool !!

    Reply

Leave a Reply

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

Gravatar
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 )

Cancel

Connecting to %s