Applied Satisfiability : Cryptography, Scheduling and Coalitional Games, Hard...
132,36 €
Professionals and researchers in this field will find the scope of their computational solutions to otherwise intractable problems vastly increased. The Boolean Satisfiability Problem (SAT) is one of the most famous and widely-studied problems in Boolean logic.
Jetzt bei Ebay: