|
|
Sold Out
Book Categories |
1. Boolean Functions; 2. Circuit Lower Bounds; Circuit Upper Bounds; 4. Randomness and Satisfiability; 5. Propositional Proof Systems; 6. Machine Models and Function Algebras; 7. Higher Types; References
| Price | Condition | Delivery | Seller | Action |
| $104.64 | Digital |
| WonderClub |
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 Functions and Computation Models
X
This Item is in Your Inventory
Boolean Functions and Computation Models
X
You must be logged in to review the productsX
X
X
Add Boolean Functions and Computation Models, The two internationally renowned authors elucidate the structure of fast parallel computation. Its complexity is emphasised through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model the, Boolean Functions and Computation Models to the inventory that you are selling on WonderClubX
X
Add Boolean Functions and Computation Models, The two internationally renowned authors elucidate the structure of fast parallel computation. Its complexity is emphasised through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model the, Boolean Functions and Computation Models to your collection on WonderClub |