If the solution to a problem can be verified quickly, does this mean it can be solved quickly as well? This is the core question that defines the P versus NP problem in computer science.
The class of questions that can be verified in polynomial time is called NP, while those that can be solved in polynomial time is called P. If the answer to the question is "yes", then P = NP; these two classes are the same, and those that are more seemingly complex can be converted into simpler problems. So far, no definitive proof of either answer has been provided, but many researchers in computer science and related disciplines have expectations about which answer is most likely.
So, are you on Team P=P? Do you think that we will find an answer to this problem that will challenge existing algorithms behind cryptography and other practical concerns relying on the difficulty of solving NP problems? Is this world Impagliazzo's Algorithmica? Take a stance with this geeky shirt.
100% combed and ring-spun cotton (Heather colors contain polyester)
Ash color is 99% combed and ring-spun cotton, 1% polyester
Heather colors are 52% combed and ring-spun cotton, 48% polyester
Athletic and Black Heather are 90% combed and ring-spun cotton, 10% polyester
Heather Prism colors are 99% combed and ring-spun cotton, 1% polyester
