Limits to Parallel Computation: P-Completeness Theory

— —

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)

Limits to Parallel Computation

P-Completeness Theory

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)

$713

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Oxford University Press Inc
01 April 1995

Parallel processing

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.

By: 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)
Imprint: Oxford University Press Inc
Country of Publication: United States
Dimensions: Height: 241mm, Width: 161mm, Spine: 28mm
Weight: 596g
ISBN: 9780195085914
ISBN 10: 0195085914
Pages: 336
Publication Date: 01 April 1995
Audience: Professional and scholarly , Undergraduate
Format: Hardback
Publisher's Status: Active

Reviews for Limits to Parallel Computation: P-Completeness Theory

""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

MOTHER'S DAY SPECIALS! SHOW ME MORE

Limits to Parallel Computation

P-Completeness Theory

$713

Hardback

Reviews for Limits to Parallel Computation: P-Completeness Theory

See Also

Contact Abbeys

Contact Galaxy

Contact Language

Contact Us

About ABBEY'S