💡 Words with a Similar Meaning to "Search problem"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| complexity classnoun | (computational complexity theory) A set of computational problems of related resource-based complexity. |
| computational problem | In theoretical computer science, a computational problem is one that asks for a solution in terms of an algorithm. |
| search algorithm | In computer science, a search algorithm is an algorithm designed to solve a search problem. |
| computability theorynoun | (computer science) The branch of the theory of computation that studies which problems are computationally solvable using different models. |
| decision problemnoun | (computing theory) A question in some formal system with a yes-or-no answer, depending on the values of input parameters. |
| computational resource | In computational complexity theory, a computational resource is a resource used by some computational models in the solution of computational problems. |
| strong np-completeness | In computational complexity, strong NP-completeness is a property of computational problems that is a special case of NP-completeness. |
| 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. |
| reductionnoun | The act, process, or result of reducing. |
| 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. |
| computational complexity theorynoun | (mathematics, computer science) A theory focusing on classifying computational problems according to their resource usage, and relating these classes to each other. |
| boolean circuitnoun | (computer science, computational complexity theory) A directed acyclic graph whose internal nodes are Boolean functions. |
| satisfiability modulo theories | In computer science and mathematical logic, satisfiability modulo theories is the problem of determining whether a mathematical formula is satisfiable. |
| optimization problemnoun | (mathematics) The problem of finding the "best" solution from all feasible solutions, given constraints defining which of the solutions are feasible, and a goal function defining which of the feasible solutions is the best one. |
| polynomial-time reductionnoun | (computational complexity theory) A method for solving one problem while using another. |
| lattice problem | In computer science, lattice problems are a class of optimization problems related to mathematical objects called lattices. |
| combinatorial optimization | a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects,. |
| 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. |
| 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. |
Translate “Search problem” into Another Language
Pick a language — the word will be pre-filled in the translator.