FREE Delivery in the UK.
Temporarily out of stock.
Order now and we'll deliver when available. We'll e-mail you with an estimated delivery date as soon as we have more information. Your account will only be charged when we dispatch the item.
Dispatched from and sold by Amazon. Gift-wrap available.
+ £2.80 delivery
Used: Good | Details
Condition: Used: Good
Comment: A good reading copy. May contain markings or be a withdrawn library copy. Expect delivery in 20 days.
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Satisfiability Problem: Theory and Applications (Series in Discrete Mathematics & Theoretical Computer Science) Hardcover – 30 Dec 1997


See all formats and editions Hide other formats and editions
Amazon Price
New from Used from
Hardcover
£170.00
£144.60 £47.94
Note: This item is eligible for click and collect. Details
Pick up your parcel at a time and place that suits you.
  • Choose from over 13,000 locations across the UK
  • Prime members get unlimited deliveries at no additional cost
How to order to an Amazon Pickup Location?
  1. Find your preferred location and add it to your address book
  2. Dispatch to this address when you check out
Learn more
click to open popover

Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone

To get the free app, enter your mobile phone number.



Product details

  • Hardcover: 724 pages
  • Publisher: American Mathematical Society (30 Dec. 1997)
  • Language: English
  • ISBN-10: 0821804790
  • ISBN-13: 978-0821804797
  • Product Dimensions: 19 x 4.4 x 26.7 cm
  • Average Customer Review: Be the first to review this item
  • Amazon Bestsellers Rank: 6,311,112 in Books (See Top 100 in Books)
  • Would you like to tell us about a lower price?
    If you are a seller for this product, would you like to suggest updates through seller support?

  • See Complete Table of Contents

Product description

Synopsis

The satisfiability (SAT) problem is central in mathematical logic, computing theory, and many industrial applications. There has been a strong relationship between the theory, the algorithms, and the applications of the SAT problem. This book aims to bring together work by the best theorists, algorithmists, and practitioners working on the SAT problem and on industrial applications, as well as to enhance the interaction between the three research groups. The book features the application of theoretical/algorithmic results to practical problems and presents practical problems for theoretical/algorithmic study.Major topics covered in the book include practical and industrial SAT problems and benchmarks, significant case studies and applications of the SAT problem and SAT algorithms, new algorithms and improved techniques for satisfiability testing, specific data structures and implementation details of the SAT algorithms, and the theoretical study of the SAT problem and SAT algorithms. It features: a comprehensive review of SAT research work over the past 25 years; the most recent research results; and a spectrum of algorithmic issues and applications.


Customer reviews

There are no customer reviews yet.
Share your thoughts with other customers

Where's My Stuff?

Delivery and Returns

Need Help?