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 theory
and proof theory. Non-uniform computation models are studied in the
form of Boolean circuits; uniform ones in a variety of forms. Steps
in the investigation of non-deterministic polynomial time are
surveyed as is the complexity of various proof systems. Providing a
survey of research in the field, the book will benefit advanced
undergraduates and graduate students as well as researchers.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
