Skip to main content alibris logo

Multilevel Techniques for Solving the Satisfiability Problem

by ,

Write The First Customer Review
Multilevel Techniques for solving the Satisfiability Problem - Salih, Sirar, and Bouhmala, Noureddine
Filter Results
Shipping
Item Condition
Seller Rating
Other Options
Change Currency

There are many complex problems in computer science that occur in knowledge-representation, artificial learning, Very Large Scale Integration (VLSI) design, security protocols and other areas. These complex problems may be deduced into satisfiability problems where the Boolean Satisfiability Problem (SAT) may be applied. This deduction is made in order to simplify complex problems into a specific propositional logic problem. The SAT problem is the most well-known nondeterministic polynomial time (NP) complete problem in ...

loading
Multilevel Techniques for solving the Satisfiability Problem 2012, LAP Lambert Academic Publishing, Saarbrucken

ISBN-13: 9783659131974

Trade paperback