by PeterClote (Author), EvangelosKranakis (Author)
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.
Format: Hardcover
Pages: 615
Publisher: Springer
Published: 19 Sep 2002
ISBN 10: 3540594361
ISBN 13: 9783540594369
From the reviews:
The monograph gives the most recent and complete description of lower bounds for depth-restricted circuits, and propositional proof systems. ... the authors present a research monograph on important subjects and provide many very recent results. I would recommend it for any university library and also for researchers. (Ingo Wegener, The Computer Journal, Vol. 46 (3), 2003)