/var/logmarcus chiu

/var/log

❯

Mathematics

❯

Computational Theory - Theory of Computation

❯

Computational Complexity Theory

❯

Complexity Classes

NEXPSPACE

Created on Dec 07, 2023

NEXPSPACE
  • is a type of complexity class containing decision problems that can be solved by a non-deterministic Turing machine using an exponential amount of memory space

Resources

  • https://en.wikipedia.org/w/index.php?title=NEXPSPACE&redirect=no