💡 Words with a Similar Meaning to "Pspace"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| expspacenoun | (computing theory) The set of all decision problems that can be solved by a Turing machine using O(2ᵖ⁽ⁿ⁾) units of memory, where p(n) is a polynomial function of the input size. |
| pspace-complete | In computational complexity theory, a decision problem is PSPACE-complete if it can be solved using an amount of memory that is polynomial in the input length (polynomial space) and if every other problem that can be solved in polynomial space can be transformed to it in polynomial time. |
| nspace | In computational complexity theory, non-deterministic space or NSPACE is the computational resource describing the memory space for a non-deterministic Turing machine. |
| exptimenoun | (computer science, computational complexity theory) The set of all decision problems that are solvable by a deterministic Turing machine in exponential time. |
| nl-complete | In computational complexity theory, NL-complete is a complexity class containing the languages that are complete for NL, the class of decision problems that can be solved by a nondeterministic Turing machine using a logarithmic amount of memory space. |
| nexptimenoun | (computer science) In computational complexity theory, a complexity class in which the set of decision problems can be solved by a nondeterministic Turing machine using time 2^(nᴼ⁽¹⁾). |
| p/poly | In computational complexity theory, P/poly is a complexity class representing problems that can be solved by small circuits. |
| p-completenoun | (computing theory) Describing any problem in the complexity class P to which there exists a polynomial time mapping from any other problem in P. |
| complexity classnoun | (computational complexity theory) A set of computational problems of related resource-based complexity. |
| space complexitynoun | (computer science) A measure of the amount of space, or memory required by an algorithm to solve a given decision problem. An informal analogy would be the amount of scratch paper needed while working out a problem with pen and paper. |
| space hierarchy theorem | In computational complexity theory, the space hierarchy theorems are separation results that show that both deterministic and nondeterministic machines can solve more problems in (asymptotically) more space, subject to certain conditions. |
| time complexitynoun | (computer science) The amount of time an algorithm requires to run, as a function of the amount of input, measured in such a way as to ignore constant terms and multiplication by constant terms. |
| pseudo-polynomial timenoun | (computer science, computational complexity theory) A time algorithm whose running time is a polynomial in the numeric value of the input, but not necessarily in the length of the input. |
| dtime | In computational complexity theory, (or TIME) the computational resource of computation time for a deterministic Turing machine. |
| search problem | In the mathematics of computational complexity theory, computability theory, and decision theory, a search problem is a type of computational problem represented by a binary relation. |
| computational resource | In computational complexity theory, a computational resource is a resource used by some computational models in the solution of computational problems. |
| function problem | In computational complexity theory, a function problem is a computational problem where a single output (of a total function) is expected for every input, but the output is more complex than that of a decision problem. |
| polynomial-time reductionnoun | (computational complexity theory) A method for solving one problem while using another. |
| strong np-completeness | In computational complexity, strong NP-completeness is a property of computational problems that is a special case of NP-completeness. |
| theory of computation | In theoretical computer science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation, using an algorithm, how efficiently they can be solved or to what degree (e.g., approximate solutions versus precise ones). |
🏷️ Nouns for "Pspace"
Common nouns this word is used to describe.
📝 Common Phrases with "Pspace"
Translate “Pspace” into Another Language
Pick a language — the word will be pre-filled in the translator.