The P versus NP problem asks whether every problem whose solution can be quickly verified can also be quickly solved. It is a major open question in computer science, with implications for cryptography, optimization, and algorithm design. A proof either way would revolutionize computational theory.

• 100% combed and ring-spun cotton
• Fabric weight: 4.2 oz./yd.² (142 g/m²)
• Pre-shrunk fabric
• Side-seamed construction
• Shoulder-to-shoulder taping