💡 Words with a Similar Meaning to "Function problem"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| 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. |
| decision problemnoun | (computing theory) A question in some formal system with a yes-or-no answer, depending on the values of input parameters. |
| parameterized complexity | In computer science, parameterized complexity is a branch of computational complexity theory that focuses on classifying computational problems according to their inherent difficulty with respect to multiple parameters of the input or output. |
| 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. |
| 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. |
| 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. |
| complexity classnoun | (computational complexity theory) A set of computational problems of related resource-based complexity. |
| circuit complexity | In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according to the size or depth of the Boolean circuits that compute them. |
| 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. |
| strong np-completeness | In computational complexity, strong NP-completeness is a property of computational problems that is a special case of NP-completeness. |
| average-case complexity | In computational complexity theory, the average-case complexity of an algorithm is the amount of some computational resource (typically time) used by the algorithm, averaged over all possible inputs. |
| circuit satisfiability problem | In theoretical computer science, the circuit satisfiability problem (also known as CIRCUIT-SAT, CircuitSAT, CSAT, etc.) is the decision problem of determining whether a given Boolean circuit has an assignment of its inputs that makes the output true. |
| computational hardness assumption | In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where efficiently typically means "in polynomial time"). |
| 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). |
| computational resource | In computational complexity theory, a computational resource is a resource used by some computational models in the solution of computational problems. |
| computational problem | In theoretical computer science, a computational problem is one that asks for a solution in terms of an algorithm. |
| 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ᴼ⁽¹⁾). |
| 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. |
| complementnoun | The totality, the full amount or number which completes something. |
| primitive recursive function | In computability theory, a primitive recursive function is, roughly speaking, a function that can be computed by a computer program whose loops are all "for" loops (that is, an upper bound of the number of iterations of every loop is fixed before entering the loop). |
Translate “Function problem” into Another Language
Pick a language — the word will be pre-filled in the translator.