The complexity of parallel computations: inherently sequential algorithms and P-complete problems
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Seattle, Wash.
1988
|
| Schriftenreihe: | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report
88,12,1 |
| Schlagworte: | |
| Beschreibung: | Zugl.: Seattle, Wash., Univ., Diss. |
| Beschreibung: | IX, 130 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009257756 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1988 m||| 00||| eng d | ||
| 035 | |a (OCoLC)475767071 | ||
| 035 | |a (DE-599)BVBBV009257756 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Greenlaw, Raymond |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The complexity of parallel computations |b inherently sequential algorithms and P-complete problems |
| 264 | 1 | |a Seattle, Wash. |c 1988 | |
| 300 | |a IX, 130 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |v 88,12,1 | |
| 500 | |a Zugl.: Seattle, Wash., Univ., Diss. | ||
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Washington <Seattle, Wash.> |v 88,12,1 |w (DE-604)BV008930431 |9 88,12,1 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006159883 | ||
Datensatz im Suchindex
| _version_ | 1804123704748146688 |
|---|---|
| any_adam_object | |
| author | Greenlaw, Raymond |
| author_facet | Greenlaw, Raymond |
| author_role | aut |
| author_sort | Greenlaw, Raymond |
| author_variant | r g rg |
| building | Verbundindex |
| bvnumber | BV009257756 |
| ctrlnum | (OCoLC)475767071 (DE-599)BVBBV009257756 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01074nam a2200289 cb4500</leader><controlfield tag="001">BV009257756</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1988 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)475767071</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009257756</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Greenlaw, Raymond</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The complexity of parallel computations</subfield><subfield code="b">inherently sequential algorithms and P-complete problems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Seattle, Wash.</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 130 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report</subfield><subfield code="v">88,12,1</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Seattle, Wash., Univ., Diss.</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University of Washington <Seattle, Wash.></subfield><subfield code="v">88,12,1</subfield><subfield code="w">(DE-604)BV008930431</subfield><subfield code="9">88,12,1</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006159883</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV009257756 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:34:00Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006159883 |
| oclc_num | 475767071 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | IX, 130 S. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| record_format | marc |
| series2 | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |
| spelling | Greenlaw, Raymond Verfasser aut The complexity of parallel computations inherently sequential algorithms and P-complete problems Seattle, Wash. 1988 IX, 130 S. txt rdacontent n rdamedia nc rdacarrier University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report 88,12,1 Zugl.: Seattle, Wash., Univ., Diss. (DE-588)4113937-9 Hochschulschrift gnd-content Department of Computer Science: Technical report University of Washington <Seattle, Wash.> 88,12,1 (DE-604)BV008930431 88,12,1 |
| spellingShingle | Greenlaw, Raymond The complexity of parallel computations inherently sequential algorithms and P-complete problems |
| subject_GND | (DE-588)4113937-9 |
| title | The complexity of parallel computations inherently sequential algorithms and P-complete problems |
| title_auth | The complexity of parallel computations inherently sequential algorithms and P-complete problems |
| title_exact_search | The complexity of parallel computations inherently sequential algorithms and P-complete problems |
| title_full | The complexity of parallel computations inherently sequential algorithms and P-complete problems |
| title_fullStr | The complexity of parallel computations inherently sequential algorithms and P-complete problems |
| title_full_unstemmed | The complexity of parallel computations inherently sequential algorithms and P-complete problems |
| title_short | The complexity of parallel computations |
| title_sort | the complexity of parallel computations inherently sequential algorithms and p complete problems |
| title_sub | inherently sequential algorithms and P-complete problems |
| topic_facet | Hochschulschrift |
| volume_link | (DE-604)BV008930431 |
| work_keys_str_mv | AT greenlawraymond thecomplexityofparallelcomputationsinherentlysequentialalgorithmsandpcompleteproblems |