3 ms·
Don't forget the case where P == 0
by naturalgradient 9y ago
Don't forget the case where P == 0
- dom0 9y agoYou'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.