NEXPTIME

complexity class
Thing Complexity Class Q1575791

Facts

4 properties
Instance of
complexity class
Has part(s)
EXPTIME, NE[3][4]
Has parts
EXPTIME, NE
🏷️ Also known as
en NEXPTIME
🔖 Identifiers · 3
BabelNet ID
03512036n
Freebase ID
/m/030wh5
Microsoft Academic ID (discontinued)
37998019

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Has part(s) 1
Has these parts 1
Instance of 1
Part of 1
Press Enter · cited answer in seconds

Summary

NEXPTIME is a complexity class[1].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.
  2. [3] ↑ . wikidata.org.
  3. [4] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). NEXPTIME. Retrieved November 17, 2026, from https://4ort.xyz/entity/nexptime
MLA “NEXPTIME.” 4ort.xyz Knowledge Graph, 4ort.xyz, 17 Nov. 2026, https://4ort.xyz/entity/nexptime.
BibTeX @misc{4ortxyz_nexptime_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{NEXPTIME}}, year = {2026}, url = {https://4ort.xyz/entity/nexptime}, note = {Accessed: 2026-11-17}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): NEXPTIME — https://4ort.xyz/entity/nexptime (retrieved 2026-11-17)

Canonical URL: https://4ort.xyz/entity/nexptime · Last refreshed: