|
|
Sold Out
Book Categories |
| Preface | ||
| 1 | Elementary Notions and Notations | 1 |
| 2 | Facts About Functions | 61 |
| 3 | Construction Techniques | 111 |
| 4 | Equivalence, Order, and Inductive Proof | 177 |
| 5 | Analysis Techniques | 253 |
| 6 | Elementary Logic | 309 |
| 7 | Predicate Logic | 355 |
| 8 | Applied Logic | 411 |
| 9 | Computational Logic | 453 |
| 10 | Algebraic Structures and Techniques | 507 |
| Answers to Selected Exercises | 581 | |
| Bibliography | 639 | |
| Greek Alphabet | 642 | |
| Symbol Glossary | 643 | |
| Index | 647 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Kate Di Pietro
reviewed Discrete Mathematics on March 10, 2020 Discrete Mathematics
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
Discrete Mathematics
X
This Item is in Your Inventory
Discrete Mathematics
X
You must be logged in to review the productsX
X
X
Add Discrete Mathematics, , Discrete Mathematics to the inventory that you are selling on WonderClubX
X
Add Discrete Mathematics, , Discrete Mathematics to your collection on WonderClub |
