Why doesn't the traveling salesman need viagra?

[blackllotus]

Because he's NP-hard.

Sorry...

 

[potoba]

uhm... ok!

 

[JohnCU]

what?

 

[SoulAssassin]

Originally posted by: JohnCU
what?

 

[destrekor]

Originally posted by: SoulAssassin

Originally posted by: JohnCU
what?

 

[theprodigalrebel]

I had to look it up:

NP-hard (nondeterministic polynomial-time hard), in computational complexity theory, is a class of problems informally "at least as hard as the hardest problems in NP." A problem H is NP-hard if and only if there is an NP-complete problem L that is polynomial time Turing-reducible to H, i.e. \scriptstyle L\, \leq\,_T H. In other words, L can be solved in polynomial time by an oracle machine with an oracle for H. Informally we can think of an algorithm that can call such an oracle machine as subroutine for solving H, and solves L in polynomial time if the subroutine call takes only one step to compute. NP-hard problems may be of any type: decision problems, search problems, optimization problems.

Too much brains required. I shall stick to lolcats and farting dogs.

 

[JohnCU]

Originally posted by: theprodigalrebel
I had to look it up:

NP-hard (nondeterministic polynomial-time hard), in computational complexity theory, is a class of problems informally "at least as hard as the hardest problems in NP." A problem H is NP-hard if and only if there is an NP-complete problem L that is polynomial time Turing-reducible to H, i.e. \scriptstyle L\, \leq\,_T H. In other words, L can be solved in polynomial time by an oracle machine with an oracle for H. Informally we can think of an algorithm that can call such an oracle machine as subroutine for solving H, and solves L in polynomial time if the subroutine call takes only one step to compute. NP-hard problems may be of any type: decision problems, search problems, optimization problems.

Too much brains required. I shall stick to lolcats and farting dogs.

Oh my god, I should have remembered that. That was in the last class I took in Comp E before i switched to EE.

 

[Howard]

wtf??

 

[mugs]

Haha... you have to have stolen that from xkcd...

 

[Reel]

Originally posted by: mugs
Haha... you have to have stolen that from xkcd...

It isn't from there. I think he respects the math too much to make that kind of silly joke.

 

[theprodigalrebel]

Originally posted by: mugs
Haha... you have to have stolen that from xkcd...

NP-Complete