A note on the average time to compute transitive closures:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Massachusetts Inst. of Technology, Lab. for Computer Science
1976
|
| Schlagworte: | |
| Beschreibung: | 10 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021882359 | ||
| 003 | DE-604 | ||
| 005 | 20040229000000.0 | ||
| 007 | t | ||
| 008 | 890126s1976 |||| 00||| eng d | ||
| 035 | |a (OCoLC)2540621 | ||
| 035 | |a (DE-599)BVBBV021882359 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 050 | 0 | |a QA76.M41 | |
| 088 | |a MIT/LCS/TM-76 | ||
| 100 | 1 | |a Bloniarz, Peter A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A note on the average time to compute transitive closures |c P. A. Bloniarz ; M. J. Fischer ; A. R. Meyer |
| 264 | 1 | |a Cambridge, Mass. |b Massachusetts Inst. of Technology, Lab. for Computer Science |c 1976 | |
| 300 | |a 10 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Algorithms | |
| 650 | 0 | 7 | |a Netzwerk |0 (DE-588)4171529-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Arbeitszeitbedarf |0 (DE-588)4002811-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Arbeitszeitbedarf |0 (DE-588)4002811-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Netzwerk |0 (DE-588)4171529-9 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Fischer, Michael J. |e Verfasser |4 aut | |
| 700 | 1 | |a Meyer, Albert R. |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015097715 | ||
Datensatz im Suchindex
| _version_ | 1804135823204941824 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Bloniarz, Peter A. Fischer, Michael J. Meyer, Albert R. |
| author_facet | Bloniarz, Peter A. Fischer, Michael J. Meyer, Albert R. |
| author_role | aut aut aut |
| author_sort | Bloniarz, Peter A. |
| author_variant | p a b pa pab m j f mj mjf a r m ar arm |
| building | Verbundindex |
| bvnumber | BV021882359 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.M41 |
| callnumber-search | QA76.M41 |
| callnumber-sort | QA 276 M41 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)2540621 (DE-599)BVBBV021882359 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01364nam a2200409zc 4500</leader><controlfield tag="001">BV021882359</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890126s1976 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)2540621</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021882359</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.M41</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TM-76</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bloniarz, Peter A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A note on the average time to compute transitive closures</subfield><subfield code="c">P. A. Bloniarz ; M. J. Fischer ; A. R. Meyer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Massachusetts Inst. of Technology, Lab. for Computer Science</subfield><subfield code="c">1976</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10 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="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Arbeitszeitbedarf</subfield><subfield code="0">(DE-588)4002811-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Arbeitszeitbedarf</subfield><subfield code="0">(DE-588)4002811-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fischer, Michael J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Meyer, Albert R.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015097715</subfield></datafield></record></collection> |
| id | DE-604.BV021882359 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:50Z |
| indexdate | 2024-07-09T20:46:37Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015097715 |
| oclc_num | 2540621 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 10 S. |
| publishDate | 1976 |
| publishDateSearch | 1976 |
| publishDateSort | 1976 |
| publisher | Massachusetts Inst. of Technology, Lab. for Computer Science |
| record_format | marc |
| spelling | Bloniarz, Peter A. Verfasser aut A note on the average time to compute transitive closures P. A. Bloniarz ; M. J. Fischer ; A. R. Meyer Cambridge, Mass. Massachusetts Inst. of Technology, Lab. for Computer Science 1976 10 S. txt rdacontent n rdamedia nc rdacarrier Algorithms Netzwerk (DE-588)4171529-9 gnd rswk-swf Kürzester-Weg-Problem (DE-588)4138403-9 gnd rswk-swf Arbeitszeitbedarf (DE-588)4002811-2 gnd rswk-swf Arbeitszeitbedarf (DE-588)4002811-2 s DE-604 Kürzester-Weg-Problem (DE-588)4138403-9 s Netzwerk (DE-588)4171529-9 s Fischer, Michael J. Verfasser aut Meyer, Albert R. Verfasser aut |
| spellingShingle | Bloniarz, Peter A. Fischer, Michael J. Meyer, Albert R. A note on the average time to compute transitive closures Algorithms Netzwerk (DE-588)4171529-9 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd Arbeitszeitbedarf (DE-588)4002811-2 gnd |
| subject_GND | (DE-588)4171529-9 (DE-588)4138403-9 (DE-588)4002811-2 |
| title | A note on the average time to compute transitive closures |
| title_auth | A note on the average time to compute transitive closures |
| title_exact_search | A note on the average time to compute transitive closures |
| title_exact_search_txtP | A note on the average time to compute transitive closures |
| title_full | A note on the average time to compute transitive closures P. A. Bloniarz ; M. J. Fischer ; A. R. Meyer |
| title_fullStr | A note on the average time to compute transitive closures P. A. Bloniarz ; M. J. Fischer ; A. R. Meyer |
| title_full_unstemmed | A note on the average time to compute transitive closures P. A. Bloniarz ; M. J. Fischer ; A. R. Meyer |
| title_short | A note on the average time to compute transitive closures |
| title_sort | a note on the average time to compute transitive closures |
| topic | Algorithms Netzwerk (DE-588)4171529-9 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd Arbeitszeitbedarf (DE-588)4002811-2 gnd |
| topic_facet | Algorithms Netzwerk Kürzester-Weg-Problem Arbeitszeitbedarf |
| work_keys_str_mv | AT bloniarzpetera anoteontheaveragetimetocomputetransitiveclosures AT fischermichaelj anoteontheaveragetimetocomputetransitiveclosures AT meyeralbertr anoteontheaveragetimetocomputetransitiveclosures |