Applied Satisfiability: Cryptography, Scheduling, and Coalitional Games by Xiaoj
121,67 €
Apply satisfiability to a range of difficult problems The Boolean Satisfiability Problem (SAT) is one of the most famous and widely-studied problems in Boolean logic. Optimization versions of this problem include the Maximum Satisfiability Problem (MaxSAT) and its extensions, such as partial MaxSAT and weighted MaxSAT, which assess whether, and to what extent, a solution satisfies a given set of problems.
Jetzt bei Ebay:
