|
|
Sold Out
Book Categories |
| Open Problems | 1 | |
| Note on the Existence of Most General Semi-unifiers | 20 | |
| Kreisel's Conjecture for L[actual symbol not reproducible] | 30 | |
| Number of Symbols in Frege Proofs with and without the Deduction Rule | 61 | |
| Algorithm for Boolean Formula Evaluation and for Tree Contraction | 96 | |
| Provably Total Functions in Bounded Arithmetic Theories R[actual symbol not reproducible], U[actual symbol not reproducible] and V[actual symbol not reproducible] | 116 | |
| On Polynomial Size Frege Proofs of Certain Combinatorial Principles | 162 | |
| Interpretability and Fragments of arithmetic | 185 | |
| Abbreviating Proofs Using Metamathematical Rules | 197 | |
| Open Induction, Tennenbaum Phenomena, and Complexity Theory | 222 | |
| Using Herbrand-type Theorems to Separate Strong Fragments of Arithmetic | 238 | |
| An Equivalence between Second Order Bounded Domain Bounded Arithmetic and First Order Bounded Arithmetic | 247 | |
| Integer Parts of Real Closed Exponential Fields (extended abstract) | 278 | |
| Making Infinite Structures Finite in Models of Second Order Bounded Arithmetic | 289 | |
| Ordinal Arithmetic in I[Delta][subscript 0] | 320 | |
| RSUV Isomorphism | 364 | |
| Feasible Interpretability | 387 |
| Price | Condition | Delivery | Seller | Action |
| $183.39 | Digital |
| WonderClub |
Chris Sperring
reviewed Arithmetic, Proof Theory, and Computational Complexity on January 01, 2016
Arithmetic
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
Arithmetic, Proof Theory, and Computational Complexity
X
This Item is in Your Inventory
Arithmetic, Proof Theory, and Computational Complexity
X
You must be logged in to review the productsX
X
X
Add Arithmetic, Proof Theory, and Computational Complexity, This book principally concerns the rapidly growing area of what might be termed Logical Complexity Theory: the study of bounded arithmetic, propositional proof systems, length of proof, and similar themes, and the relations of these topics to compu, Arithmetic, Proof Theory, and Computational Complexity to the inventory that you are selling on WonderClubX
X
Add Arithmetic, Proof Theory, and Computational Complexity, This book principally concerns the rapidly growing area of what might be termed Logical Complexity Theory: the study of bounded arithmetic, propositional proof systems, length of proof, and similar themes, and the relations of these topics to compu, Arithmetic, Proof Theory, and Computational Complexity to your collection on WonderClub |