Limits to parallel computation :: P-completeness theory /
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 pro...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | , |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York :
Oxford University Press,
1995.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | 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 an interest in the super computers of the future. |
| Beschreibung: | 1 online resource (xiii, 311 pages) |
| Bibliographie: | Includes bibliographical references (pages 255-284) and index. |
| ISBN: | 1429406429 9781429406420 1280540036 9781280540035 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocm72565860 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 061011s1995 nyu ob 001 0 eng d | ||
| 010 | |z 94031180 | ||
| 040 | |a N$T |b eng |e pn |c N$T |d YDXCP |d OCLCQ |d E7B |d OCLCQ |d OCLCF |d OCLCO |d NLGGC |d MERUC |d EBLCP |d IDEBK |d OCLCQ |d AGLDB |d STF |d OCLCQ |d VTS |d OCLCQ |d LOA |d K6U |d OCLCQ |d INARC |d AU@ |d CEF |d OCLCO |d OCLCQ |d SFB |d OCLCQ |d OCLCO |d OCLCQ |d OCLCL |d SXB |d OCLCQ | ||
| 019 | |a 466426541 |a 476008661 |a 647836887 |a 748537698 |a 814460422 |a 819512337 |a 821694644 |a 1035685152 |a 1107744412 |a 1109951272 |a 1117870746 | ||
| 020 | |a 1429406429 |q (electronic bk.) | ||
| 020 | |a 9781429406420 |q (electronic bk.) | ||
| 020 | |z 9780195085914 | ||
| 020 | |z 0195085914 | ||
| 020 | |a 1280540036 | ||
| 020 | |a 9781280540035 | ||
| 035 | |a (OCoLC)72565860 |z (OCoLC)466426541 |z (OCoLC)476008661 |z (OCoLC)647836887 |z (OCoLC)748537698 |z (OCoLC)814460422 |z (OCoLC)819512337 |z (OCoLC)821694644 |z (OCoLC)1035685152 |z (OCoLC)1107744412 |z (OCoLC)1109951272 |z (OCoLC)1117870746 | ||
| 050 | 4 | |a QA76.58 |b .G74 1995eb | |
| 072 | 7 | |a COM |x 048000 |2 bisacsh | |
| 072 | 7 | |a UHDP |2 bicssc | |
| 082 | 7 | |a 004/.35 |2 22 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Greenlaw, Raymond. | |
| 245 | 1 | 0 | |a Limits to parallel computation : |b P-completeness theory / |c Raymond Greenlaw, H. James Hoover, Walter L. Ruzzo. |
| 260 | |a New York : |b Oxford University Press, |c 1995. | ||
| 300 | |a 1 online resource (xiii, 311 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a data file |2 rda | ||
| 504 | |a Includes bibliographical references (pages 255-284) and index. | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a Cover -- Contents -- Preface -- Part I58; Background and Theory -- 1 Introduction -- 146;1 Bandersnatch Design -- 146;2 Informal Background -- 146;3 Some History -- 146;4 Related Works -- 146;5 Overview of This Book -- 2 Parallel Models of Computation -- 1 Introduction -- 2 The PRAM Model -- 3 The Boolean Circuit Model -- 4 Circuits and PRAMs -- 3 Complexity -- 346;1 Search and Decision Problems -- 346;2 Complexity Classes -- 346;3 Reducibility -- 346;4 Other NC Compatible Reducibilities -- 346;5 Completeness -- 4 Two Basic P45;Complete Problems -- 446;1 The Generic P45;Complete Problem -- 446;2 The Circuit Value Problem -- 5 Evidence That NC Does Not Equal P -- 546;1 Introduction -- 546;2 General Simulations Are Not Fast -- 546;3 Fast Simulations Are Not General -- 546;4 Natural Approaches Provably Fail -- 546;5 Summary -- 6 The Circuit Value Problem -- 646;1 The Circuit Value Problem Is P45;Complete -- 646;2 Restricted Versions of Cimiit Value -- 7 Greedy Algorithms -- 746;1 Lexicographic Greedy Algorithms -- 746;2 Generic Greedy Algorithms -- 8 P45;Complete Algorithms -- 846;1 Introduction -- 846;2 Inherently Sequential Algorithms -- 846;3 Applications of the Model -- 9 Two Other Notions of P45;Completeness -- 946;1 Strong P45;Completeness -- 946;2 Strict P45;Completeness -- 10 Approximating P45;Complete Problems -- 1046;1 Introduction -- 1046;2 Approximating LFMIS Is Hard -- 1046;3 Approximation Schemes -- 11 Closing Remarks -- Part II58; A Compendium of Problems -- A58; P45;Complete Problems -- A46;1 Circuit Complexity -- A46;2 Graph Theory -- A46;3 Searching Graphs -- A46;4 Combinatorial Optimization -- A46;5 Local Optimality -- A46;6 Logic -- A46;7 Formal Languages -- A46;8 Algebra -- A46;9 Geometry -- A46;10 Real Analysis -- A46;11 Games -- A46;12 Miscellaneous -- B58; Open Problems -- B46;1 Graph Theory -- B46;2 Combinatorial Optimization -- B46;3 Logic -- B46;4 Formal Languages -- B46;5 Algebra -- B46;6 Geometry -- B46;7 Real Analysis -- B46;8 CC -- B46;9 RNC -- C58; Notation -- D58; Complexity Classes -- D46;1 Definitions -- D46;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 -- Last Page. | |
| 520 | |a 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 an interest in the super computers of the future. | ||
| 650 | 0 | |a Parallel processing (Electronic computers) |0 http://id.loc.gov/authorities/subjects/sh85097826 | |
| 650 | 6 | |a Parallélisme (Informatique) | |
| 650 | 7 | |a COMPUTERS |x Systems Architecture |x Distributed Systems & Computing. |2 bisacsh | |
| 650 | 7 | |a Parallel processing (Electronic computers) |2 fast | |
| 653 | 0 | |a Parallel programming | |
| 655 | 4 | |a Electronic book. | |
| 700 | 1 | |a Hoover, H. James. | |
| 700 | 1 | |a Ruzzo, Walter L. | |
| 776 | 0 | 8 | |i Print version: |a Greenlaw, Raymond. |t Limits to parallel computation. |d New York : Oxford University Press, 1995 |z 0195085914 |w (DLC) 94031180 |w (OCoLC)31046455 |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=169637 |3 Volltext |
| 938 | |a Internet Archive |b INAR |n limitstoparallel0000gree | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL271822 | ||
| 938 | |a ebrary |b EBRY |n ebr10358324 | ||
| 938 | |a EBSCOhost |b EBSC |n 169637 | ||
| 938 | |a YBP Library Services |b YANK |n 2484485 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n 54003 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocm72565860 |
|---|---|
| _version_ | 1816881641985933312 |
| adam_text | |
| any_adam_object | |
| author | Greenlaw, Raymond |
| author2 | Hoover, H. James Ruzzo, Walter L. |
| author2_role | |
| author2_variant | h j h hj hjh w l r wl wlr |
| author_facet | Greenlaw, Raymond Hoover, H. James Ruzzo, Walter L. |
| author_role | |
| author_sort | Greenlaw, Raymond |
| author_variant | r g rg |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.58 .G74 1995eb |
| callnumber-search | QA76.58 .G74 1995eb |
| callnumber-sort | QA 276.58 G74 41995EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Cover -- Contents -- Preface -- Part I58; Background and Theory -- 1 Introduction -- 146;1 Bandersnatch Design -- 146;2 Informal Background -- 146;3 Some History -- 146;4 Related Works -- 146;5 Overview of This Book -- 2 Parallel Models of Computation -- 1 Introduction -- 2 The PRAM Model -- 3 The Boolean Circuit Model -- 4 Circuits and PRAMs -- 3 Complexity -- 346;1 Search and Decision Problems -- 346;2 Complexity Classes -- 346;3 Reducibility -- 346;4 Other NC Compatible Reducibilities -- 346;5 Completeness -- 4 Two Basic P45;Complete Problems -- 446;1 The Generic P45;Complete Problem -- 446;2 The Circuit Value Problem -- 5 Evidence That NC Does Not Equal P -- 546;1 Introduction -- 546;2 General Simulations Are Not Fast -- 546;3 Fast Simulations Are Not General -- 546;4 Natural Approaches Provably Fail -- 546;5 Summary -- 6 The Circuit Value Problem -- 646;1 The Circuit Value Problem Is P45;Complete -- 646;2 Restricted Versions of Cimiit Value -- 7 Greedy Algorithms -- 746;1 Lexicographic Greedy Algorithms -- 746;2 Generic Greedy Algorithms -- 8 P45;Complete Algorithms -- 846;1 Introduction -- 846;2 Inherently Sequential Algorithms -- 846;3 Applications of the Model -- 9 Two Other Notions of P45;Completeness -- 946;1 Strong P45;Completeness -- 946;2 Strict P45;Completeness -- 10 Approximating P45;Complete Problems -- 1046;1 Introduction -- 1046;2 Approximating LFMIS Is Hard -- 1046;3 Approximation Schemes -- 11 Closing Remarks -- Part II58; A Compendium of Problems -- A58; P45;Complete Problems -- A46;1 Circuit Complexity -- A46;2 Graph Theory -- A46;3 Searching Graphs -- A46;4 Combinatorial Optimization -- A46;5 Local Optimality -- A46;6 Logic -- A46;7 Formal Languages -- A46;8 Algebra -- A46;9 Geometry -- A46;10 Real Analysis -- A46;11 Games -- A46;12 Miscellaneous -- B58; Open Problems -- B46;1 Graph Theory -- B46;2 Combinatorial Optimization -- B46;3 Logic -- B46;4 Formal Languages -- B46;5 Algebra -- B46;6 Geometry -- B46;7 Real Analysis -- B46;8 CC -- B46;9 RNC -- C58; Notation -- D58; Complexity Classes -- D46;1 Definitions -- D46;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 -- Last Page. |
| ctrlnum | (OCoLC)72565860 |
| dewey-full | 004/.35 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004/.35 |
| dewey-search | 004/.35 |
| dewey-sort | 14 235 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05764cam a2200625 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocm72565860 </controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">061011s1995 nyu ob 001 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="z"> 94031180 </subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">E7B</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCO</subfield><subfield code="d">NLGGC</subfield><subfield code="d">MERUC</subfield><subfield code="d">EBLCP</subfield><subfield code="d">IDEBK</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AGLDB</subfield><subfield code="d">STF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">LOA</subfield><subfield code="d">K6U</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">INARC</subfield><subfield code="d">AU@</subfield><subfield code="d">CEF</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SXB</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">466426541</subfield><subfield code="a">476008661</subfield><subfield code="a">647836887</subfield><subfield code="a">748537698</subfield><subfield code="a">814460422</subfield><subfield code="a">819512337</subfield><subfield code="a">821694644</subfield><subfield code="a">1035685152</subfield><subfield code="a">1107744412</subfield><subfield code="a">1109951272</subfield><subfield code="a">1117870746</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1429406429</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781429406420</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780195085914</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0195085914</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1280540036</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781280540035</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)72565860</subfield><subfield code="z">(OCoLC)466426541</subfield><subfield code="z">(OCoLC)476008661</subfield><subfield code="z">(OCoLC)647836887</subfield><subfield code="z">(OCoLC)748537698</subfield><subfield code="z">(OCoLC)814460422</subfield><subfield code="z">(OCoLC)819512337</subfield><subfield code="z">(OCoLC)821694644</subfield><subfield code="z">(OCoLC)1035685152</subfield><subfield code="z">(OCoLC)1107744412</subfield><subfield code="z">(OCoLC)1109951272</subfield><subfield code="z">(OCoLC)1117870746</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.58</subfield><subfield code="b">.G74 1995eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">048000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">UHDP</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">004/.35</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Greenlaw, Raymond.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Limits to parallel computation :</subfield><subfield code="b">P-completeness theory /</subfield><subfield code="c">Raymond Greenlaw, H. James Hoover, Walter L. Ruzzo.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">New York :</subfield><subfield code="b">Oxford University Press,</subfield><subfield code="c">1995.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiii, 311 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">data file</subfield><subfield code="2">rda</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 255-284) and index.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Cover -- Contents -- Preface -- Part I58; Background and Theory -- 1 Introduction -- 146;1 Bandersnatch Design -- 146;2 Informal Background -- 146;3 Some History -- 146;4 Related Works -- 146;5 Overview of This Book -- 2 Parallel Models of Computation -- 1 Introduction -- 2 The PRAM Model -- 3 The Boolean Circuit Model -- 4 Circuits and PRAMs -- 3 Complexity -- 346;1 Search and Decision Problems -- 346;2 Complexity Classes -- 346;3 Reducibility -- 346;4 Other NC Compatible Reducibilities -- 346;5 Completeness -- 4 Two Basic P45;Complete Problems -- 446;1 The Generic P45;Complete Problem -- 446;2 The Circuit Value Problem -- 5 Evidence That NC Does Not Equal P -- 546;1 Introduction -- 546;2 General Simulations Are Not Fast -- 546;3 Fast Simulations Are Not General -- 546;4 Natural Approaches Provably Fail -- 546;5 Summary -- 6 The Circuit Value Problem -- 646;1 The Circuit Value Problem Is P45;Complete -- 646;2 Restricted Versions of Cimiit Value -- 7 Greedy Algorithms -- 746;1 Lexicographic Greedy Algorithms -- 746;2 Generic Greedy Algorithms -- 8 P45;Complete Algorithms -- 846;1 Introduction -- 846;2 Inherently Sequential Algorithms -- 846;3 Applications of the Model -- 9 Two Other Notions of P45;Completeness -- 946;1 Strong P45;Completeness -- 946;2 Strict P45;Completeness -- 10 Approximating P45;Complete Problems -- 1046;1 Introduction -- 1046;2 Approximating LFMIS Is Hard -- 1046;3 Approximation Schemes -- 11 Closing Remarks -- Part II58; A Compendium of Problems -- A58; P45;Complete Problems -- A46;1 Circuit Complexity -- A46;2 Graph Theory -- A46;3 Searching Graphs -- A46;4 Combinatorial Optimization -- A46;5 Local Optimality -- A46;6 Logic -- A46;7 Formal Languages -- A46;8 Algebra -- A46;9 Geometry -- A46;10 Real Analysis -- A46;11 Games -- A46;12 Miscellaneous -- B58; Open Problems -- B46;1 Graph Theory -- B46;2 Combinatorial Optimization -- B46;3 Logic -- B46;4 Formal Languages -- B46;5 Algebra -- B46;6 Geometry -- B46;7 Real Analysis -- B46;8 CC -- B46;9 RNC -- C58; Notation -- D58; Complexity Classes -- D46;1 Definitions -- D46;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 -- Last Page.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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 an interest in the super computers of the future.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Parallel processing (Electronic computers)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85097826</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Parallélisme (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Systems Architecture</subfield><subfield code="x">Distributed Systems & Computing.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Parallel processing (Electronic computers)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="653" ind1="0" ind2=" "><subfield code="a">Parallel programming</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic book.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hoover, H. James.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ruzzo, Walter L.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Greenlaw, Raymond.</subfield><subfield code="t">Limits to parallel computation.</subfield><subfield code="d">New York : Oxford University Press, 1995</subfield><subfield code="z">0195085914</subfield><subfield code="w">(DLC) 94031180</subfield><subfield code="w">(OCoLC)31046455</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=169637</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Internet Archive</subfield><subfield code="b">INAR</subfield><subfield code="n">limitstoparallel0000gree</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL271822</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10358324</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">169637</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2484485</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">54003</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| genre | Electronic book. |
| genre_facet | Electronic book. |
| id | ZDB-4-EBA-ocm72565860 |
| illustrated | Not Illustrated |
| indexdate | 2024-11-27T13:15:57Z |
| institution | BVB |
| isbn | 1429406429 9781429406420 1280540036 9781280540035 |
| language | English |
| oclc_num | 72565860 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xiii, 311 pages) |
| psigel | ZDB-4-EBA |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| publisher | Oxford University Press, |
| record_format | marc |
| spelling | Greenlaw, Raymond. Limits to parallel computation : P-completeness theory / Raymond Greenlaw, H. James Hoover, Walter L. Ruzzo. New York : Oxford University Press, 1995. 1 online resource (xiii, 311 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier data file rda Includes bibliographical references (pages 255-284) and index. Print version record. Cover -- Contents -- Preface -- Part I58; Background and Theory -- 1 Introduction -- 146;1 Bandersnatch Design -- 146;2 Informal Background -- 146;3 Some History -- 146;4 Related Works -- 146;5 Overview of This Book -- 2 Parallel Models of Computation -- 1 Introduction -- 2 The PRAM Model -- 3 The Boolean Circuit Model -- 4 Circuits and PRAMs -- 3 Complexity -- 346;1 Search and Decision Problems -- 346;2 Complexity Classes -- 346;3 Reducibility -- 346;4 Other NC Compatible Reducibilities -- 346;5 Completeness -- 4 Two Basic P45;Complete Problems -- 446;1 The Generic P45;Complete Problem -- 446;2 The Circuit Value Problem -- 5 Evidence That NC Does Not Equal P -- 546;1 Introduction -- 546;2 General Simulations Are Not Fast -- 546;3 Fast Simulations Are Not General -- 546;4 Natural Approaches Provably Fail -- 546;5 Summary -- 6 The Circuit Value Problem -- 646;1 The Circuit Value Problem Is P45;Complete -- 646;2 Restricted Versions of Cimiit Value -- 7 Greedy Algorithms -- 746;1 Lexicographic Greedy Algorithms -- 746;2 Generic Greedy Algorithms -- 8 P45;Complete Algorithms -- 846;1 Introduction -- 846;2 Inherently Sequential Algorithms -- 846;3 Applications of the Model -- 9 Two Other Notions of P45;Completeness -- 946;1 Strong P45;Completeness -- 946;2 Strict P45;Completeness -- 10 Approximating P45;Complete Problems -- 1046;1 Introduction -- 1046;2 Approximating LFMIS Is Hard -- 1046;3 Approximation Schemes -- 11 Closing Remarks -- Part II58; A Compendium of Problems -- A58; P45;Complete Problems -- A46;1 Circuit Complexity -- A46;2 Graph Theory -- A46;3 Searching Graphs -- A46;4 Combinatorial Optimization -- A46;5 Local Optimality -- A46;6 Logic -- A46;7 Formal Languages -- A46;8 Algebra -- A46;9 Geometry -- A46;10 Real Analysis -- A46;11 Games -- A46;12 Miscellaneous -- B58; Open Problems -- B46;1 Graph Theory -- B46;2 Combinatorial Optimization -- B46;3 Logic -- B46;4 Formal Languages -- B46;5 Algebra -- B46;6 Geometry -- B46;7 Real Analysis -- B46;8 CC -- B46;9 RNC -- C58; Notation -- D58; Complexity Classes -- D46;1 Definitions -- D46;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 -- Last Page. 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 an interest in the super computers of the future. Parallel processing (Electronic computers) http://id.loc.gov/authorities/subjects/sh85097826 Parallélisme (Informatique) COMPUTERS Systems Architecture Distributed Systems & Computing. bisacsh Parallel processing (Electronic computers) fast Parallel programming Electronic book. Hoover, H. James. Ruzzo, Walter L. Print version: Greenlaw, Raymond. Limits to parallel computation. New York : Oxford University Press, 1995 0195085914 (DLC) 94031180 (OCoLC)31046455 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=169637 Volltext |
| spellingShingle | Greenlaw, Raymond Limits to parallel computation : P-completeness theory / Cover -- Contents -- Preface -- Part I58; Background and Theory -- 1 Introduction -- 146;1 Bandersnatch Design -- 146;2 Informal Background -- 146;3 Some History -- 146;4 Related Works -- 146;5 Overview of This Book -- 2 Parallel Models of Computation -- 1 Introduction -- 2 The PRAM Model -- 3 The Boolean Circuit Model -- 4 Circuits and PRAMs -- 3 Complexity -- 346;1 Search and Decision Problems -- 346;2 Complexity Classes -- 346;3 Reducibility -- 346;4 Other NC Compatible Reducibilities -- 346;5 Completeness -- 4 Two Basic P45;Complete Problems -- 446;1 The Generic P45;Complete Problem -- 446;2 The Circuit Value Problem -- 5 Evidence That NC Does Not Equal P -- 546;1 Introduction -- 546;2 General Simulations Are Not Fast -- 546;3 Fast Simulations Are Not General -- 546;4 Natural Approaches Provably Fail -- 546;5 Summary -- 6 The Circuit Value Problem -- 646;1 The Circuit Value Problem Is P45;Complete -- 646;2 Restricted Versions of Cimiit Value -- 7 Greedy Algorithms -- 746;1 Lexicographic Greedy Algorithms -- 746;2 Generic Greedy Algorithms -- 8 P45;Complete Algorithms -- 846;1 Introduction -- 846;2 Inherently Sequential Algorithms -- 846;3 Applications of the Model -- 9 Two Other Notions of P45;Completeness -- 946;1 Strong P45;Completeness -- 946;2 Strict P45;Completeness -- 10 Approximating P45;Complete Problems -- 1046;1 Introduction -- 1046;2 Approximating LFMIS Is Hard -- 1046;3 Approximation Schemes -- 11 Closing Remarks -- Part II58; A Compendium of Problems -- A58; P45;Complete Problems -- A46;1 Circuit Complexity -- A46;2 Graph Theory -- A46;3 Searching Graphs -- A46;4 Combinatorial Optimization -- A46;5 Local Optimality -- A46;6 Logic -- A46;7 Formal Languages -- A46;8 Algebra -- A46;9 Geometry -- A46;10 Real Analysis -- A46;11 Games -- A46;12 Miscellaneous -- B58; Open Problems -- B46;1 Graph Theory -- B46;2 Combinatorial Optimization -- B46;3 Logic -- B46;4 Formal Languages -- B46;5 Algebra -- B46;6 Geometry -- B46;7 Real Analysis -- B46;8 CC -- B46;9 RNC -- C58; Notation -- D58; Complexity Classes -- D46;1 Definitions -- D46;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 -- Last Page. Parallel processing (Electronic computers) http://id.loc.gov/authorities/subjects/sh85097826 Parallélisme (Informatique) COMPUTERS Systems Architecture Distributed Systems & Computing. bisacsh Parallel processing (Electronic computers) fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85097826 |
| title | Limits to parallel computation : P-completeness theory / |
| title_auth | Limits to parallel computation : P-completeness theory / |
| title_exact_search | Limits to parallel computation : P-completeness theory / |
| title_full | Limits to parallel computation : P-completeness theory / Raymond Greenlaw, H. James Hoover, Walter L. Ruzzo. |
| title_fullStr | Limits to parallel computation : P-completeness theory / Raymond Greenlaw, H. James Hoover, Walter L. Ruzzo. |
| title_full_unstemmed | Limits to parallel computation : P-completeness theory / Raymond Greenlaw, H. James Hoover, Walter L. Ruzzo. |
| title_short | Limits to parallel computation : |
| title_sort | limits to parallel computation p completeness theory |
| title_sub | P-completeness theory / |
| topic | Parallel processing (Electronic computers) http://id.loc.gov/authorities/subjects/sh85097826 Parallélisme (Informatique) COMPUTERS Systems Architecture Distributed Systems & Computing. bisacsh Parallel processing (Electronic computers) fast |
| topic_facet | Parallel processing (Electronic computers) Parallélisme (Informatique) COMPUTERS Systems Architecture Distributed Systems & Computing. Electronic book. |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=169637 |
| work_keys_str_mv | AT greenlawraymond limitstoparallelcomputationpcompletenesstheory AT hooverhjames limitstoparallelcomputationpcompletenesstheory AT ruzzowalterl limitstoparallelcomputationpcompletenesstheory |