You're both wrong.
P is the union of all TIME complexity classes defined by n^k for every natural k.
NP is the union of all NTIME complexity classes defined by n^k for every natural k.
P is the union of all TIME complexity classes defined by n^k for every natural k.
NP is the union of all NTIME complexity classes defined by n^k for every natural k.
No comments yet.