p = np

p = np is widely considered to be important to cryptography
p = np is one of the most important unsolved problems in all of
p = np is equivalent over the ring of complex numbers
p = np is one of the greatest unsolved
p = np is the first of seven million
p = np is a pending problem
p = np is one of the greatest unsolved problems in computer science
p = np is one of the great unsolved mysteries in contemporary mathematics
p = np is the most famous unsolved problem in the theoretical study of algorithms
p = np is an apparently very difficult one which has been studied in some form or another for a long time
p = np is not known
p = np is 1 and 5 but not 2 or 3 or 6 or 7 or 8
p = np is undecideable
p = np is d iffic ult to im agin e; ps = n ps is ea sy *p roo f inv olve s ­s imu latio n of nt mt hat has a po lyno mia l
p = np is difficult to imagine; ps
p = np is the most
p = np is consistent with pa
p = np is a hard
p = np is implied if the conjecture holds
p = np is now answered
p = np is more than the
p = np is undecideable are being far too pessimistic
p = np is still an open problem