non-deterministic polynomial time
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.
The Urban Dictionary Mug
Why soooo accurateee😩
I love seeing new products, this one is awesome!
It's a very good idea and I'm so glad ☺
Veryfast ship in todays world...nice quality mug....will be buying more
Review Details
Pro Customization
Create unique products with your own words and definitions
Live Preview
Personalize Your Design
Debug: Product Metadata
| Key | Value (click to copy) |
|---|---|
Copied! |
Return Policy
Made Just For You
Each product is custom-printed with your unique text, making it truly one-of-a-kind.
Defect-Free Guarantee
If your product arrives with printing defects, damage, or quality issues, we'll send you a free replacement.
Custom Orders
Due to the personalized nature of your order, we don't accept returns for change of mind or sizing issues.
Questions about your order? Contact our support team for assistance.