PSPACE
释义与例句
name
-
1.
The set of all decision problems that can be solved by a Turing machine using an amount of memory which is a polynomial function of the input size.
计算机 工程 数学
The set of all decision problems that can be solved by a Turing machine using an amount of memory which is a polynomial function of the input size.