| Display title | NEXPTIME |
| Default sort key | Nexptime |
| Page length (in bytes) | 6,764 |
| Namespace ID | 0 |
| Page ID | 305655 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Rtextdoc |
| Date of page creation | 17:54, 6 February 2024 |
| Latest editor | imported>Rtextdoc |
| Date of latest edit | 17:54, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In computational complexity theory, the complexity class NEXPTIME (sometimes called NEXP) is the set of decision problems that can be solved by a non-deterministic Turing machine using time $ 2^{n^{O(1)}} $.
In terms of NTIME,
$ {\mathsf {NEXPTIME}}=\bigcup _{k\in \mathbb {N} }{\mathsf {NTIME}}(2^{n... |
