💡 Words with a Similar Meaning to "Expspace"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| pspacenoun | (computing theory) 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. |
| exptimenoun | (computer science, computational complexity theory) The set of all decision problems that are solvable by a deterministic Turing machine in exponential time. |
| 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. |
| 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ᴼ⁽¹⁾). |
| 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. |
| nspace | In computational complexity theory, non-deterministic space or NSPACE is the computational resource describing the memory space for a non-deterministic Turing machine. |
| 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. |
| 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. |
| 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. |
| dtime | In computational complexity theory, (or TIME) the computational resource of computation time for a deterministic Turing machine. |
| 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. |
| 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). |
| complexity theorynoun | (computer science) The study and classification of decision problems by the computational resources—such as time and space—needed by the programs that solve the problems. |
| computable set | In computability theory, a set of natural numbers is called computable, recursive, or decidable if there is an algorithm which takes a number as input, terminates after a finite amount of time (possibly depending on the given number) and correctly decides whether the number belongs to the set or not. |
| model of computation | In computer science, and more specifically in computability theory and computational complexity theory, a model of computation is a model which describes how an output of a mathematical function is computed given an input. |
| maximum satisfiability problem | In computational complexity theory, the maximum satisfiability problem is the problem of determining the maximum number of clauses, of a given Boolean formula in conjunctive normal form, that can be made true by an assignment of truth values to the variables of the formula. |
| 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. |
| constructible universe | In mathematics, in set theory, the constructible universe (or Gödel's constructible universe), denoted by is a particular class of sets that can be described entirely in terms of simpler sets. |
| index set | In mathematics, an index set is a set whose members label (or index) members of another set. |
| complexity classnoun | (computational complexity theory) A set of computational problems of related resource-based complexity. |
Translate “Expspace” into Another Language
Pick a language — the word will be pre-filled in the translator.