Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
New York :
Oxford University Press,
1995.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000Ia 4500 | ||
|---|---|---|---|
| 001 | EBSCO_ocm72565860 | ||
| 003 | OCoLC | ||
| 005 | 20231017213018.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 | ||
| 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 | ||
| 029 | 1 | |a AU@ |b 000051585105 | |
| 029 | 1 | |a DEBBG |b BV043067955 | |
| 029 | 1 | |a DEBSZ |b 422250732 | |
| 029 | 1 | |a GBVCP |b 802177085 | |
| 029 | 1 | |a AU@ |b 000062570912 | |
| 029 | 1 | |a AU@ |b 000069138610 | |
| 029 | 1 | |a DKDLA |b 820120-katalog:999932624005765 | |
| 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 | 0 | 4 | |a 004/.35 |2 22 |
| 049 | |a UAMI | ||
| 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. | ||
| 590 | |a eBooks on EBSCOhost |b EBSCO eBook Subscription Academic Collection - Worldwide | ||
| 650 | 0 | |a Parallel processing (Electronic computers) | |
| 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 |0 (OCoLC)fst01052928 | |
| 653 | 0 | |a Parallel programming | |
| 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 | |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=169637 |z Texto completo |
| 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 IZTAP | ||