|
|
Sold Out
Book Categories |
| Preface | ||
| List of Participants | ||
| Relationships Between Monotone and Non-Monotone Network Complexity | 1 | |
| On Read-Once Boolean Functions | 25 | |
| Boolean Function Complexity: a Lattice-Theoretic Perspective | 35 | |
| Monotone Complexity | 57 | |
| On Submodular Complexity Measures | 76 | |
| Why is Boolean Complexity Theory so Difficult? | 84 | |
| The Multiplicative Complexity of Boolean Quadratic Forms, a Survey | 95 | |
| Some Problems Involving Razborov-Smolensky Polynomials | 109 | |
| Symmetry Functions in AC[superscript 0] can be computed in Constant Depth with very Small Size | 129 | |
| Boolean Complexity and Probabilistic Constructions | 140 | |
| Networks Computing Boolean Functions for Multiple Input Values | 165 | |
| Optimal Carry Save Networks | 174 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Neal Chagnon
reviewed Boolean Function Complexity, Vol. 169 on February 23, 2009
Boolean Function Complexity
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
Boolean Function Complexity, Vol. 169
X
This Item is in Your Inventory
Boolean Function Complexity, Vol. 169
X
You must be logged in to review the productsX
X
X
Add Boolean Function Complexity, Vol. 169, Boolean function complexity has seen exciting advances in the past few years. It is a long established area of discrete mathematics that uses combinatorial and occasionally algebraic methods. Professor Paterson brings together papers from the 1990 Durham , Boolean Function Complexity, Vol. 169 to the inventory that you are selling on WonderClubX
X
Add Boolean Function Complexity, Vol. 169, Boolean function complexity has seen exciting advances in the past few years. It is a long established area of discrete mathematics that uses combinatorial and occasionally algebraic methods. Professor Paterson brings together papers from the 1990 Durham , Boolean Function Complexity, Vol. 169 to your collection on WonderClub |