登入選單
返回Google圖書搜尋
其他書名
P-Completeness Theory
出版Oxford University Press, 1995-04-06
主題Computers / Distributed Systems / GeneralMathematics / Discrete Mathematics
ISBN01953589029780195358902
URLhttp://books.google.com.hk/books?id=Yd_LvW00T04C&hl=&source=gbs_api
EBookSAMPLE
註釋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.