Computational Complexity of SAT, Xsat and Nae-SAT

By Tatjana Schmidt

The Boolean conjunctive normal form (CNF) satisability problem, called SAT for short, gets as input a CNF formula and has to decide whether this formula admits a satisfying truth assignment. As is... This description may be from another edition of this product.

• Format: Paperback
• Language: English
• ISBN: 3838123662
• ISBN13: 9783838123660
• Release Date: February 2011
• Publisher: Sudwestdeutscher Verlag Fur Hochschulschrifte
• Length: 172 Pages
• Weight: 0.57 lbs.
• Dimensions: 0.4" x 6.0" x 9.0"