9786132868176 - Maximum Satisfiability Problem: Computational complexity theory, Propositional formula, NP-hard, Boolean satisfiability problem, NP-complete, APX (3 resultados)

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 76 pp. Englisch.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In computationalcomplexity theory, the Maximum Satisfiability problem, or MAX-SAT, isthe problem of determining the maximum number of clauses, of a givenBoolean formula, that can be satisfied by some assignment. The MAX-SATproblem is NP-hard, since its solution easily leads to the solution ofthe boolean satisfiability problem, which is NP-complete. It is alsoAPX-complete, and thus does not admit a PTAS unless P = NP. MAX-SAT isone of the optimization extensions of the boolean satisfiabilityproblem, which is the problem of determining if the variables of a givenBoolean formula can be assigned in such a way as to make the formulaevaluate to TRUE. If the clauses are restricted to have at most 2literals, as in 2-satisfiability, we get the MAX-2SAT problem. If theyare restricted to at most 3 literals per clause, as in 3-satisfiabilitywe get the MAX-3SAT problem.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 76 pp. Englisch.

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering.