Items related to On the Complexity of the Satisfiability Problem (Classic...
Synopsis
Excerpt from On the Complexity of the Satisfiability Problem
I would like to acknowledge the support and assistance of Martin Davis, Malcolm Harrison, Alan Konheim, Sandra Rapps, Salvatore Stolfo, Patricia Tobin, and the excellent typist Connie Engle. This thesis is dedicated to the memory of my father, Morris Goldberg, to whom I shall always.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"synopsis" may belong to another edition of this title.
- PublisherForgotten Books
- Publication date2020
- ISBN 10 1332172474
- ISBN 13 9781332172474
- BindingPaperback
- LanguageEnglish
- Number of pages99
Buy New
View this item
US$ 18.28
Shipping:
FREE
From United Kingdom to U.S.A.
Other Popular Editions of the Same Title
Search results for On the Complexity of the Satisfiability Problem (Classic...
Seller Image
On the Complexity of the Satisfiability Problem (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book explores the complexity of the satisfiability problem (SAT), which is central to many fields of computer science, such as computational complexity and theorem proving. SAT is a computational problem that asks whether a given Boolean formula can be made true by assigning truth values to its variables. Despite the apparent simplicity of SAT, its worst-case time complexity, meaning the longest amount of time it could possibly take an algorithm to solve the problem, has been an open question in computer science. This book provides an average-case analysis of the Davis-Putnam procedure (DPP), an algorithm for solving SAT, which shows that under many common distributions of SAT problems, DPP is likely to run in polynomial time. This means that the algorithm will likely run in an amount of time that is bounded by a polynomial function of the size of the input problem, such as the number of variables and clauses in the formula. The book also explores the relationship between DPP and resolution-based procedures, which are widely used in automated theorem proving to demonstrate that DPP is comparable to these procedures in terms of proof length and power. Overall, this book provides a comprehensive analysis of the computational complexity of SAT and the effectiveness of DPP in solving it, offering insights into the tractability of this fundamental problem. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781332172474_0
Quantity: Over 20 available
Stock Image
On the Complexity of the Satisfiability Problem Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332172474
Quantity: 15 available
Stock Image
On the Complexity of the Satisfiability Problem Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332172474
Quantity: 15 available