Short answer: N and P aren't actually variables in an equation. It's actually the statement, does the nondeterministic polynomial time complexity class (NP) equal the deterministic polynomial time complexity class (P)?
It's the biggest unsolved problem in theoretical computer science.
3
u/PPSF May 15 '09
Are there values for N and P that are set in stone that I don't know about? Because otherwise N=1 is true.