NEXPTIME
NEXPTIME
Common
Rarity: Common
The most frequent rarity: most Wikipedia articles become Commons.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
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
Excerpt from the Wikipedia article “NEXPTIME”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Open free boosters and add NEXPTIME to your collection.
Play for free




