💡 Words with a Similar Meaning to "Maximum satisfiability problem"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| boolean satisfiability problem | In logic and computer science, the (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY, SAT or B-SAT) the problem of determining if there exists an interpretation that satisfies a given Boolean formula. |
| 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. |
| satisfiability modulo theories | In computer science and mathematical logic, satisfiability modulo theories is the problem of determining whether a mathematical formula is satisfiable. |
| 2-satisfiability | In computer science, 2-satisfiability, 2-SAT or just 2SAT is a computational problem of assigning values to variables, each of which has two possible values, in order to satisfy a system of constraints on pairs of variables. |
| 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. |
| 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. |
| dpll algorithm | In logic and computer science, the Davis–Putnam–Logemann–Loveland algorithm is a complete, backtracking-based search algorithm for deciding the satisfiability of propositional logic formulae in conjunctive normal form, i.e. for solving the CNF-SAT problem. |
| 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. |
| horn-satisfiability | In formal logic, Horn-satisfiability, or HORNSAT, is the problem of deciding whether a given set of propositional Horn clauses is satisfiable or not. |
| 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). |
| constrained optimization | In mathematical optimization, constrained optimization (in some contexts called constraint optimization) is the process of optimizing an objective function with respect to some variables in the presence of constraints on those variables. |
| maximum subarray problem | In computer science, the maximum sum subarray problem, also known as the maximum segment sum problem, is the task of finding a contiguous subarray with the largest sum, within a given one-dimensional array A[1...n] of numbers. |
| generalized assignment problem | In applied mathematics, the maximum generalized assignment problem is a problem in combinatorial optimization. |
| 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. |
| 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 weight matching | In computer science and graph theory, the maximum weight matching problem is the problem of finding, in a weighted graph, a matching in which the sum of weights is maximized. |
| 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. |
| partition problem | In number theory and computer science, the partition problem, or number partitioning, is the task of deciding whether a given multiset S of positive integers can be partitioned into two subsets S1 and S2 such that the sum of the numbers in S1 equals the sum of the numbers in S2. |
| local consistency | In constraint satisfaction, local consistency conditions are properties of constraint satisfaction problems related to the consistency of subsets of variables or constraints. |
| conjunctive normal formnoun | (logic) The form of a Boolean formula that the formula has if the formula is a conjunction of disjunctions of literals, such as “(A or B or C) and (D or E or not F)”. |
Translate “Maximum satisfiability problem” into Another Language
Pick a language — the word will be pre-filled in the translator.