Limits to parallel computation : P-completeness theory
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.
Uložené v:
| Hlavní autori: | , , |
|---|---|
| Médium: | E-kniha Kniha |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
Oxford University Press
1995
Oxford University Press, Incorporated |
| Vydanie: | 1 |
| Predmet: | |
| ISBN: | 9780195085914, 0195085914 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | 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. |
|---|---|
| AbstractList | 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. This volume provides an ideal introduction to key topics in parallel computing.With its cogent overview of the essentials of the subject as well as lists of P -complete- and open problems, extensive remarks corresponding to each problem, a thorough index, and extensive references, the book will prove invaluable to programmers stuck on problems that are particularly difficult to parallelize. In providing an up-to-date survey of parallel computing research from 1994, Topics in Parallel Computing will prove invaluable to researchers and professionals with aninterest in the super computers of the future. |
| Author | Greenlaw, Raymond Ruzzo, Walter L. Hoover, H. James |
| Author_xml | – sequence: 1 fullname: Greenlaw, Raymond – sequence: 2 fullname: Hoover, H. James – sequence: 3 fullname: Ruzzo, Walter L. |
| BackLink | https://cir.nii.ac.jp/crid/1130000798028176768$$DView record in CiNii |
| BookMark | eNpV0EtLAzEQB_CIVlprv8MeRPCwkGwek3jTUh-woAfxuqR50LXppjap4rd314rgHGb4w4-BmTN00sXOHaGZAomJ4pRLhavjv4wlV4SN0FgxTAmR-BRNgElOQSg5RrOU3nBfRFWc8QkSdbtpcypyLLZ6p0NwoTBxs91nndvYFdfFcznk4LLrXOrhysXd1zkaeR2Sm_3OKXq9W7zMH8r66f5xflOXWnDAvOTM6KUBAGeN99pQhZ2wAEZZv-SgMXhrPfWcWMqUMp5QAOYEscoAw5pO0dVhsU5r95lWMeTUfAS3jHGdmn8_6O3lwW538X3vUm5-mHFd7i9rFrfzCoisBnhxgF3bNqYdOiF0eAsoiStJQICQ9BsIeGR0 |
| ContentType | eBook Book |
| DBID | RYH |
| DEWEY | 005.2 |
| DatabaseName | CiNii Complete |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9780195358902 0195358902 |
| Edition | 1 |
| ExternalDocumentID | 9780195358902 EBC271822 BA24746850 |
| GroupedDBID | -VX 089 20A 38. A4J AABBV AAFQY ABARN ABFDL ABMRC ABQPQ ACFVK ACLGV ADHWY ADVEM ADWOK AERYV AEXCD AFOJC AFTHB AFXKH AHJNT AHQWO AHWGJ AIGZA AIXPE AJFER ALMA_UNASSIGNED_HOLDINGS AZZ BBABE BTL CWTWH CZZ DUGUG EBSCA ECOWB GEOUK JJU MYL NRCWT PQQKQ RYH SAVCC TI5 XI1 ZBOWZ |
| ID | FETCH-LOGICAL-a65705-54cabc777edcffac390e6d77c9dfb57a07fddf3f51d3499cf13774e61d9c740a3 |
| ISBN | 9780195085914 0195085914 |
| IngestDate | Fri Apr 25 07:31:36 EDT 2025 Wed Dec 10 09:52:06 EST 2025 Thu Jun 26 22:37:09 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCN | 94031180 |
| LCCallNum_Ident | QA76.58 .G74 1995 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a65705-54cabc777edcffac390e6d77c9dfb57a07fddf3f51d3499cf13774e61d9c740a3 |
| Notes | Includes index Bibliography: p.255-284 |
| OCLC | 748537698 |
| PQID | EBC271822 |
| PageCount | 328 |
| ParticipantIDs | askewsholts_vlebooks_9780195358902 proquest_ebookcentral_EBC271822 nii_cinii_1130000798028176768 |
| PublicationCentury | 1900 |
| PublicationDate | c1995 1995 1995-06-01 |
| PublicationDateYYYYMMDD | 1995-01-01 1995-06-01 |
| PublicationDate_xml | – year: 1995 text: c1995 |
| PublicationDecade | 1990 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationYear | 1995 |
| Publisher | Oxford University Press Oxford University Press, Incorporated |
| Publisher_xml | – name: Oxford University Press – name: Oxford University Press, Incorporated |
| SSID | ssj0000192545 ssib031902520 |
| Score | 1.8786882 |
| Snippet | 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... This volume provides an ideal introduction to key topics in parallel computing.With its cogent overview of the essentials of the subject as well as lists of P... |
| SourceID | askewsholts proquest nii |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Computers Parallel processing (Electronic computers) |
| TableOfContents | B.9 RNC -- C: Notation -- D: Complexity Classes -- D.1 Definitions -- D.2 Relationships Among Complexity Classes -- Bibliography -- Problem List -- Index -- A -- B -- C -- D -- E -- F -- G -- H -- I -- J -- K -- L -- M -- N -- O -- P -- Q -- R -- S -- T -- U -- V -- W -- Y -- Z Intro -- Contents -- Preface -- Part I: Background and Theory -- 1 Introduction -- 1.1 Bandersnatch Design -- 1.2 Informal Background -- 1.3 Some History -- 1.4 Related Works -- 1.5 Overview of This Book -- 2 Parallel Models of Computation -- 2.1 Introduction -- 2.2 The PRAM Model -- 2.3 The Boolean Circuit Model -- 2.4 Circuits and PRAMs -- 3 Complexity -- 3.1 Search and Decision Problems -- 3.2 Complexity Classes -- 3.3 Reducibility -- 3.4 Other NC Compatible Reducibilities -- 3.5 Completeness -- 4 Two Basic P-Complete Problems -- 4.1 The Generic P-Complete Problem -- 4.2 The Circuit Value Problem -- 5 Evidence That NC Does Not Equal P -- 5.1 Introduction -- 5.2 General Simulations Are Not Fast -- 5.3 Fast Simulations Are Not General -- 5.4 Natural Approaches Provably Fail -- 5.5 Summary -- 6 The Circuit Value Problem -- 6.1 The Circuit Value Problem Is P-Complete -- 6.2 Restricted Versions of Cimiit Value -- 7 Greedy Algorithms -- 7.1 Lexicographic Greedy Algorithms -- 7.2 Generic Greedy Algorithms -- 8 P-Complete Algorithms -- 8.1 Introduction -- 8.2 Inherently Sequential Algorithms -- 8.3 Applications of the Model -- 9 Two Other Notions of P-Completeness -- 9.1 Strong P-Completeness -- 9.2 Strict P-Completeness -- 10 Approximating P-Complete Problems -- 10.1 Introduction -- 10.2 Approximating LFMIS Is Hard -- 10.3 Approximation Schemes -- 11 Closing Remarks -- Part II: A Compendium of Problems -- A: P-Complete Problems -- A.1 Circuit Complexity -- A.2 Graph Theory -- A.3 Searching Graphs -- A.4 Combinatorial Optimization -- A.5 Local Optimality -- A.6 Logic -- A.7 Formal Languages -- A.8 Algebra -- A.9 Geometry -- A.10 Real Analysis -- A.11 Games -- A.12 Miscellaneous -- B: Open Problems -- B.1 Graph Theory -- B.2 Combinatorial Optimization -- B.3 Logic -- B.4 Formal Languages -- B.5 Algebra -- B.6 Geometry -- B.7 Real Analysis -- B.8 CC |
| Title | Limits to parallel computation : P-completeness theory |
| URI | https://cir.nii.ac.jp/crid/1130000798028176768 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=271822 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9780195358902&uid=none |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LS-RAEG503MN68bG7OD6DeJNI3p32pjIquLgiunoLnX7AYMiIyYj6663qdDKOiywevDSTQJrhq6br-VURspN4OqVK-i4NuHZBX_suU0K6OajqnFOpw5SbYRP0_Dy9vWUXtsFjZcYJ0LJMn57Y_ZeKGt6BsJE6-wlxd5vCC_gNQocVxA7rO4u4e7R0ZuQqmYYN2M-7KFRhCsbHtp4Qff8L15SQo6GMN1zdEvMnJTgFN7meS_4Mf1h2Qh-1lZ6ne01hbZeoGb-8mGjrjcm77_7em8QRGl72VBzhA37ilLvpmZmxMWton-_6VB8eBBGNkhQDKLM0AUd47mTw5_qsi3ihMQn2WtPXyO5jWyB1z_Nknld3cL3D1V9XoO_L4fAfLWlU_9Ui6SEdZInMqHKZLLRDMBx7J_4gSQO7U4-cFnbnDezOvjMNutOA_pP8PR5cHZ26dhiFy7E6KHbjSPBcUAonW2jNRcg8lUhKBZM6jyn3qJZwtHXsyxDcSKGxl2OkEl8yQSOPh79IrxyVagV58uBlBgxtVxFp5aU0SFQockklx25GfbL9BoXssTCJ8yqzUIUxJof7ZAPAycQQVx-zkmDusRTsRR_QT9I-2Wphy8z3tto3GxweBWCRBMHqf3ZYI98nB2Wd9OqHsdog38RjPaweNq14XwGbVjIt |
| linkProvider | ProQuest Ebooks |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Limits+to+parallel+computation+%3A+P-completeness+theory&rft.au=Greenlaw%2C+Raymond&rft.au=Hoover%2C+H.+James&rft.au=Ruzzo%2C+Walter+L.&rft.date=1995-01-01&rft.pub=Oxford+University+Press&rft.isbn=9780195085914&rft.externalDocID=BA24746850 |
| thumbnail_m | http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97801953%2F9780195358902.jpg |