Limits to Parallel Computation: P-Completeness Theory

Author:   Raymond Greenlaw (Assistant Professor, Department of Computer Science, Assistant Professor, Department of Computer Science, University of New Hampshire) ,  H. James Hoover (Associate Professor, Department of Computer Science, Associate Professor, Department of Computer Science, University of Alberta) ,  Walter L. Ruzzo (Professor, Department of Computer Science, Professor, Department of Computer Science, University of Washington) ,  Walter L. Ruzzo (Professor, Department of Computer Science, University of Washington, USA)
Publisher:   Oxford University Press Inc
ISBN:  

9780195085914


Pages:   336
Publication Date:   01 June 1995
Format:   Hardback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $688.00 Quantity:  
Add to Cart

Share |

Limits to Parallel Computation: P-Completeness Theory


Add your own review!

Overview

This book provides a comprehensive analysis of the most important topics in parallel computation. It is written so that it may be used as a self-study guide to the field, and researchers in parallel computing will find it a useful reference for many years to come. The first half of the book consists of an introduction to many fundamental issues in parallel computing. The second half provides lists of P-complete- and open problems. These lists will have lasting value to researchers in both industry and academia. The lists of problems, with their corresponding remarks, the thorough index, and the hundreds of references add to the exceptional value of this resource. While the exciting field of parallel computation continues to expand rapidly, this book serves as a guide to research done through 1994 and also describes the fundamental concepts that new workers will need to know in coming years. It is intended for anyone interested in parallel computing, including senior level undergraduate students, graduate students, faculty, and people in industry. As an essential reference, the book will be needed in all academic libraries.

Full Product Details

Author:   Raymond Greenlaw (Assistant Professor, Department of Computer Science, Assistant Professor, Department of Computer Science, University of New Hampshire) ,  H. James Hoover (Associate Professor, Department of Computer Science, Associate Professor, Department of Computer Science, University of Alberta) ,  Walter L. Ruzzo (Professor, Department of Computer Science, Professor, Department of Computer Science, University of Washington) ,  Walter L. Ruzzo (Professor, Department of Computer Science, University of Washington, USA)
Publisher:   Oxford University Press Inc
Imprint:   Oxford University Press Inc
Dimensions:   Width: 16.10cm , Height: 2.80cm , Length: 24.10cm
Weight:   0.596kg
ISBN:  

9780195085914


ISBN 10:   0195085914
Pages:   336
Publication Date:   01 June 1995
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

PART I: Background and Theory 1: Introduction 2: Parallel Models and Complexity Classes 3: Two Basic P-Complete Problems 4: Evidence that NC Does Not Equal P 5: The Circuit Value Problem 6: Parallel Versions of Sequential Paradigms 7: Boolean Circuits PART II: P-Complete and Open Problems 8: List of P-Complete Problems 9: Open Problems

Reviews

"""This is an excellent book about the classification of computing problems....I am sure that it can be useful as a textbook for students or as basic material for researchers wanting to start some research in this area."" --Mathematical Reviews ""This is an excellent book about the classification of computing problems....I am sure that it can be useful as a textbook for students or as basic material for researchers wanting to start some research in this area."" --Mathematical Reviews"


an excellent reference manual. ... All the chapters are well written, and the extensive bibliography is useful. The authors have been extremely thorough and careful. ... the theory of P-completeness gives us important insights into the nature of the limits of parallel computation, and Greenlaw, Hoover, and Ruzzo have written an excellent reference work. I recommend it highly. * Eric Allender, Computing Reviews, July 1996. *


This is an excellent book about the classification of computing problems....I am sure that it can be useful as a textbook for students or as basic material for researchers wanting to start some research in this area. --Mathematical Reviews<br>


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List