What is Non-deterministic Polynomial Time?

1.

The set of the most difficult problems in Mathematics, solvable in polynomial time only by a non-deterministic turing machine, but verifiable in polynomial time. In mathematics and computer science is shortened to np. Of course, the editors of UD would rather publish BULLSHIT or several thousand entries for George Bush than something having to do with math. Also, why won't they publish "S4R" is a perfectly acceptable definition.

Rule number 5 + Rule number 10 guys. Seriously. I'm an editor too.

Aaron: Did you know the editors of UD don't actually follow rules 5 and 10?

Mike: Yeah, they turned down my definition for "np", y'know, its short for "Non-deterministic Polynomial time".

James: Yeah, and then the go and publish shit like "S.C.L.I.D". Apparently technical terms for guns are fine, but not in Math.

Aaron: Yeah, seriousy uncouth.

Mike: HOLLA!

See np, mathematics, algorithm
76

Random Words:

Inpsychosane
1. a cross between psycho and insane. slight variations can be made: inpsychosanity, inpsycho wow. look at that dude. he's totally i..
Read more
Tutwhoring
1. the act of graduate students selling their precious time to tutor undergrads for money. Chemistry grad students often engage in tutwhor..
Read more
Neaging
1. When you have snot in the back of your nose and you make a horse type sound while trying to blow it out of your nostrils. Dude my dad&a..
Read more

Best StartPage for your browser.

All you need for a faster workflow in one place.



Get it for Free