Boolean Functions and Computation Models

Condition - Very Good
The item shows wear from consistent use, but it remains in good condition and functions properly. Item may arrive with damaged packaging or be repackaged. It may be marked, have identifying markings on it, or have minor cosmetic damage. It may also be missing some parts/accessories or bundled items.

Boolean Functions and Computation Models
- New
- Mint Condition
- Dispatch same day for order received before 12 noon
- Guaranteed packaging
- No quibbles returns
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.

Country	USA
Brand	Springer
Manufacturer	Springer
Binding	Hardcover
ItemPartNumber	19 black & white illustrations, 19 black
Model	19 black & white illustrations, 19 black
ReleaseDate	2002-09-19
UnitCount	1
EANs	9783540594369

Customers who purchased this also purchased....