computational complexity theory, the maximum satisfiability problem (MAX-SAT) is the problem of determining the maximum number of clauses, of a given Boolean...

science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY, SAT or B-SAT) asks whether...

more general problems, which are NP-complete, 2-satisfiability can be solved in polynomial time. Instances of the 2-satisfiability problem are typically...

NP-completeness of the problem can be shown, for example, by a reduction from maximum 2-satisfiability (a restriction of the maximum satisfiability problem). The weighted...

are incomplete satisfiability algorithms. They may find a solution of a problem, but they may fail even if the problem is satisfiable. They work by iteratively...

sequence of bits. An instance of the satisfiability problem should have a valid proof if and only if it is satisfiable. The proof is checked by an algorithm...

problems is not obvious. The Cook–Levin theorem states that the Boolean satisfiability problem is NP-complete, thus establishing that such problems do...

NP-complete by reducing Exact cover to Knapsack. Satisfiability: the boolean satisfiability problem for formulas in conjunctive normal form (often referred...

the halting problem is NP-hard but not NP-complete. For example, the Boolean satisfiability problem can be reduced to the halting problem by transforming...

MAXEkSAT is a problem in computational complexity theory that is a maximization version of the Boolean satisfiability problem 3SAT. In MAXEkSAT, each...

NP-hard problems: Integer programming Nonlinear programming Travelling salesman problem (TSP) Quadratic assignment problem (QAP) Maximum satisfiability problem...

partially filled square can be completed) Maximum 2-satisfiability: LO5  Maximum volume submatrix – Problem of selecting the best conditioned subset of...

theory, the quantified Boolean formula problem (QBF) is a generalization of the Boolean satisfiability problem in which both existential quantifiers and...

NP-complete problems. They remain NP-complete even for special kinds of graphs, such as: bipartite graphs, undirected planar graphs of maximum degree three...

Pythagorean Triples Problem via Cube-and-Conquer". In Creignou, N.; Le Berre, D. (eds.). Theory and Applications of Satisfiability Testing – SAT 2016....

science, including proof complexity and algorithms for the maximum satisfiability problem. She is a professor of computer science at the Polytechnic University...

Satisfiability) is a method for automated planning. It converts the planning problem instance into an instance of the Boolean satisfiability problem (SAT)...

Parreira, A (2000). "Variable neighborhood search for weighted maximum satisfiability problem". Les Cahiers du GERAD G–2000–62, HEC Montréal, Canada. Hansen...

Boolean satisfiability problem despite there being no known efficient algorithm in the general case. The Boolean satisfiability (or SAT) problem can be...

shown by a reduction from the following version of the Boolean satisfiability problem, which was shown to be NP-complete likewise to the unrestricted...

the planar 3-satisfiability problem (abbreviated PLANAR 3SAT or PL3SAT) is an extension of the classical Boolean 3-satisfiability problem to a planar incidence...

NP-completeness can be proven by reduction from 3-satisfiability or, as Karp did, by reduction from the clique problem. Vertex cover remains NP-complete even in...

previous guesses).[better source needed] The Mastermind satisfiability problem (MSP) is a decision problem that asks, "Given a set of guesses and the number...

split subsets. Set splitting is special case of the not-all-equal satisfiability problem without negated variables. Additionally, Ek-set splitting equals...

for satisfiability is to convert it into a DNF, the satisfiability of which can be checked in linear time 1 ≤ m ≤ {\displaystyle 1\leq m\leq } maximum number...

algorithms for solving instances of the max-SAT (maximum satisfiable problem) and Minimum Multicut problems, together with an overview of the quantum annealing...

The k {\displaystyle k} -SAT problem is a version of the Boolean satisfiability problem in which the input to the problem is a Boolean expression in conjunctive...

optimization and simulated annealing. The satisfiability problem, also called the feasibility problem, is just the problem of finding any feasible solution at...

and Gerhard Woeginger. Maximum Satisfiability Archived 2007-04-13 at the Wayback Machine. A compendium of NP optimization problems Archived 2007-04-05 at...

D. P. (1995), "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming", Journal of the ACM, 42...