Parallel complexity of logical query programs:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1985
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN-CS
1089 |
| Schlagworte: | |
| Beschreibung: | 42 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009227375 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1985 |||| 00||| eng d | ||
| 035 | |a (OCoLC)18514390 | ||
| 035 | |a (DE-599)BVBBV009227375 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 050 | 0 | |a QA76.6 | |
| 100 | 1 | |a Ullman, Jeffrey D. |d 1942- |e Verfasser |0 (DE-588)123598230 |4 aut | |
| 245 | 1 | 0 | |a Parallel complexity of logical query programs |c by Jeffrey D. Ullman ; Allen van Gelder |
| 264 | 1 | |a Stanford, Calif. |c 1985 | |
| 300 | |a 42 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN-CS |v 1089 | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 650 | 0 | 7 | |a Abfragesprache |0 (DE-588)4134011-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Logische Programmierung |0 (DE-588)4195096-3 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Abfragesprache |0 (DE-588)4134011-5 |D s |
| 689 | 0 | 1 | |a Logische Programmierung |0 (DE-588)4195096-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Van Gelder, Allen |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 1089 |w (DE-604)BV008928280 |9 1089 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006136065 | ||
Datensatz im Suchindex
| _version_ | 1804123670685155328 |
|---|---|
| any_adam_object | |
| author | Ullman, Jeffrey D. 1942- Van Gelder, Allen |
| author_GND | (DE-588)123598230 |
| author_facet | Ullman, Jeffrey D. 1942- Van Gelder, Allen |
| author_role | aut aut |
| author_sort | Ullman, Jeffrey D. 1942- |
| author_variant | j d u jd jdu g a v ga gav |
| building | Verbundindex |
| bvnumber | BV009227375 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.6 |
| callnumber-search | QA76.6 |
| callnumber-sort | QA 276.6 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)18514390 (DE-599)BVBBV009227375 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01349nam a2200373 cb4500</leader><controlfield tag="001">BV009227375</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1985 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)18514390</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009227375</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="050" ind1=" " ind2="0"><subfield code="a">QA76.6</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ullman, Jeffrey D.</subfield><subfield code="d">1942-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)123598230</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel complexity of logical query programs</subfield><subfield code="c">by Jeffrey D. Ullman ; Allen van Gelder</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">42 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">Stanford University / Computer Science Department: Report STAN-CS</subfield><subfield code="v">1089</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Abfragesprache</subfield><subfield code="0">(DE-588)4134011-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Logische Programmierung</subfield><subfield code="0">(DE-588)4195096-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Abfragesprache</subfield><subfield code="0">(DE-588)4134011-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Logische Programmierung</subfield><subfield code="0">(DE-588)4195096-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Van Gelder, Allen</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN-CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1089</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1089</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006136065</subfield></datafield></record></collection> |
| id | DE-604.BV009227375 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:28Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006136065 |
| oclc_num | 18514390 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 42 S. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Ullman, Jeffrey D. 1942- Verfasser (DE-588)123598230 aut Parallel complexity of logical query programs by Jeffrey D. Ullman ; Allen van Gelder Stanford, Calif. 1985 42 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 1089 Computational complexity Parallel programming (Computer science) Abfragesprache (DE-588)4134011-5 gnd rswk-swf Logische Programmierung (DE-588)4195096-3 gnd rswk-swf Abfragesprache (DE-588)4134011-5 s Logische Programmierung (DE-588)4195096-3 s DE-604 Van Gelder, Allen Verfasser aut Computer Science Department: Report STAN-CS Stanford University 1089 (DE-604)BV008928280 1089 |
| spellingShingle | Ullman, Jeffrey D. 1942- Van Gelder, Allen Parallel complexity of logical query programs Computational complexity Parallel programming (Computer science) Abfragesprache (DE-588)4134011-5 gnd Logische Programmierung (DE-588)4195096-3 gnd |
| subject_GND | (DE-588)4134011-5 (DE-588)4195096-3 |
| title | Parallel complexity of logical query programs |
| title_auth | Parallel complexity of logical query programs |
| title_exact_search | Parallel complexity of logical query programs |
| title_full | Parallel complexity of logical query programs by Jeffrey D. Ullman ; Allen van Gelder |
| title_fullStr | Parallel complexity of logical query programs by Jeffrey D. Ullman ; Allen van Gelder |
| title_full_unstemmed | Parallel complexity of logical query programs by Jeffrey D. Ullman ; Allen van Gelder |
| title_short | Parallel complexity of logical query programs |
| title_sort | parallel complexity of logical query programs |
| topic | Computational complexity Parallel programming (Computer science) Abfragesprache (DE-588)4134011-5 gnd Logische Programmierung (DE-588)4195096-3 gnd |
| topic_facet | Computational complexity Parallel programming (Computer science) Abfragesprache Logische Programmierung |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT ullmanjeffreyd parallelcomplexityoflogicalqueryprograms AT vangelderallen parallelcomplexityoflogicalqueryprograms |