Limits to Parallel Computation: P-Completeness Theory

Limits to Parallel Computation: P-Completeness Theory

ISBN-10:
0195085914
ISBN-13:
9780195085914
Pub. Date:
04/06/1995
Publisher:
Oxford University Press
ISBN-10:
0195085914
ISBN-13:
9780195085914
Pub. Date:
04/06/1995
Publisher:
Oxford University Press
Limits to Parallel Computation: P-Completeness Theory

Limits to Parallel Computation: P-Completeness Theory

Hardcover

$450.0
Current price is , Original price is $450.0. You
$450.00 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores
  • SHIP THIS ITEM

    Temporarily Out of Stock Online

    Please check back later for updated availability.


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.

Product Details

ISBN-13: 9780195085914
Publisher: Oxford University Press
Publication date: 04/06/1995
Edition description: New Edition
Pages: 336
Product dimensions: 6.32(w) x 9.50(h) x 1.08(d)

About the Author

University of New Hampshire

University of Alberta, Canada

University of Washington

Table of Contents

PART I: Background and Theory1. Introduction2. Parallel Models and Complexity Classes3. Two Basic P-Complete Problems4. Evidence that NC Does Not Equal P5. The Circuit Value Problem6. Parallel Versions of Sequential Paradigms7. Boolean CircuitsPART II: P-Complete and Open Problems8. List of P-Complete Problems9. Open Problems
From the B&N Reads Blog

Customer Reviews