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:

Jimmy P
1. a man who only thinks with his cock. However his sexyness makes women crazy. Jimmy=Sex addict Jimmy P is so confident he thinks he co..
Read more
Idfer
1. teenybopper fan of AI contestants; A name given to the teenybopper fans that post at Idolforums Those IDFers are whack!..
Read more
Smoretarded
1. One who is incapable of either creating or eating a smore without making a complete mess of themselves. Originally found at primakow/ev..
Read more

Best StartPage for your browser.

All you need for a faster workflow in one place.



Get it for Free