P-space

P-space, or Polynomial Space, is a complexity class in computational complexity theory. It consists of decision problems that can be solved by a deterministic Turing machine using a polynomial amount of memory (space), regardless of the time it takes to compute the answer. In other words, a language belongs to P-space if there exists an algorithm that can decide whether a string belongs to the language using an amount of memory that can be bounded by a polynomial function of the length of the input string.