{
"item_title" : "Boolean Functions and Computation Models",
"item_author" : [" Peter Clote", "Evangelos Kranakis "],
"item_description" : "A survey of research on boolean functions, circuits, parallel computation models, function algebras, and proof systems, focusing on the structure of fast parallel computation. The complexity of parallel computation is emphasized through a variety of techniques ranging from finite combinatorics, probability theory, and finite group theory, to finite model theory and proof theory.",
"item_img_path" : "https://covers2.booksamillion.com/covers/bam/3/54/059/436/3540594361_b.jpg",
"price_data" : {
"retail_price" : "84.99", "online_price" : "84.99", "our_price" : "84.99", "club_price" : "84.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Overview
A survey of research on boolean functions, circuits, parallel computation models, function algebras, and proof systems, focusing on the structure of "fast" parallel computation. The complexity of parallel computation is emphasized through a variety of techniques ranging from finite combinatorics, probability theory, and finite group theory, to finite model theory and proof theory.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9783540594369
- ISBN-10: 3540594361
- Publisher: Springer
- Publish Date: September 2002
- Dimensions: 9.58 x 6.42 x 1.15 inches
- Shipping Weight: 2.35 pounds
- Page Count: 602
Related Categories
