|
|
Sold Out
Book Categories |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Michel Devries
reviewed Using Sophisticated Models in Resolution Theorem Proving on December 12, 2013
Using Sophisticated Models in Resolution Theorem Proving
If you read this book as first time in order to understand Computational Complexity, then you're probably not going to like it. You need to read Sipser's textbook before you read this book and make sure that you have a strong background in discrete mathematics (if not, then see Rosen's textbook in Discrete Mathematics). This book is recommended by best people in complexity and algorithms such as Scott Aaronson, Sipser, etc. You need to solve as many exercises as you go.
The book has five parts:
Part I: Algorithms
Part II: Logic
Part III: P and NP
Part IV: Inside P
Part V: Beyond NP
The most important parts are in Part I, III.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Using Sophisticated Models in Resolution Theorem Proving
X
This Item is in Your Inventory
Using Sophisticated Models in Resolution Theorem Proving
X
You must be logged in to review the productsX
X
X
Add Using Sophisticated Models in Resolution Theorem Proving, , Using Sophisticated Models in Resolution Theorem Proving to the inventory that you are selling on WonderClubX
X
Add Using Sophisticated Models in Resolution Theorem Proving, , Using Sophisticated Models in Resolution Theorem Proving to your collection on WonderClub |