Contributed by
"William E. Emba"
P vs NP is perhaps the greatest problem of theoretical computer science,
and has attracted attention of a range of mathematicians, from logic
to topology. It's one of the seven Clay Millennium Prize problems
(click here).
It also has connections with theoretical cryptography.
In "Antibodies", the discovery that P=NP (which is described with some
plausible mathematical jargon) provokes a peculiar, frightened, and
rather unexpected reaction. (But rather funny from outside.)
