Information AboutNtime |
| CATEGORIES ABOUT NTIME | |
| computational resources | |
|
The well-known complexity class NP can be defined in terms of NTIME as follows: : Similarly, the class NEXPTIME is defined in terms of NTIME. The non-deterministic Time Hierarchy Theorem says that nondeterministic machines can solve more problems in asymptotically more time. |
|
|