On the computational complexity of program schemata:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Nichtbestimmte Sprache |
| Veröffentlicht: |
St. Augustin
GMD
1974
|
| Schriftenreihe: | Institut für Theorie der Automaten und Schaltnetzwerke <Bonn>. Seminarberichte.
70 |
| Umfang: | 38 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009050365 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 940227s1974 xx |||| 00||| und d | ||
| 035 | |a (OCoLC)634625821 | ||
| 035 | |a (DE-599)BVBBV009050365 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-91G |a DE-83 | ||
| 100 | 1 | |a Weihrauch, Klaus |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On the computational complexity of program schemata |
| 264 | 1 | |a St. Augustin |b GMD |c 1974 | |
| 300 | |a 38 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Institut für Theorie der Automaten und Schaltnetzwerke <Bonn>. Seminarberichte. |v 70 | |
| 830 | 0 | |a Institut für Theorie der Automaten und Schaltnetzwerke <Bonn>. Seminarberichte. |v 70 |w (DE-604)BV008909998 |9 70 | |
| 940 | 1 | |q TUB-nveb | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005990215 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6052-196 |
|---|---|
| DE-BY-TUM_katkey | 617370 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010110002 |
| _version_ | 1821930946409005058 |
| any_adam_object | |
| author | Weihrauch, Klaus |
| author_facet | Weihrauch, Klaus |
| author_role | aut |
| author_sort | Weihrauch, Klaus |
| author_variant | k w kw |
| building | Verbundindex |
| bvnumber | BV009050365 |
| ctrlnum | (OCoLC)634625821 (DE-599)BVBBV009050365 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00900nam a2200277 cb4500</leader><controlfield tag="001">BV009050365</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940227s1974 xx |||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)634625821</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009050365</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Weihrauch, Klaus</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the computational complexity of program schemata</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">St. Augustin</subfield><subfield code="b">GMD</subfield><subfield code="c">1974</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">38 Bl.</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">Institut für Theorie der Automaten und Schaltnetzwerke <Bonn>. Seminarberichte.</subfield><subfield code="v">70</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Institut für Theorie der Automaten und Schaltnetzwerke <Bonn>. Seminarberichte.</subfield><subfield code="v">70</subfield><subfield code="w">(DE-604)BV008909998</subfield><subfield code="9">70</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">TUB-nveb</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005990215</subfield></datafield></record></collection> |
| id | DE-604.BV009050365 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:31:08Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005990215 |
| oclc_num | 634625821 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-83 |
| owner_facet | DE-91G DE-BY-TUM DE-83 |
| physical | 38 Bl. |
| psigel | TUB-nveb |
| publishDate | 1974 |
| publishDateSearch | 1974 |
| publishDateSort | 1974 |
| publisher | GMD |
| record_format | marc |
| series | Institut für Theorie der Automaten und Schaltnetzwerke <Bonn>. Seminarberichte. |
| series2 | Institut für Theorie der Automaten und Schaltnetzwerke <Bonn>. Seminarberichte. |
| spellingShingle | Weihrauch, Klaus On the computational complexity of program schemata Institut für Theorie der Automaten und Schaltnetzwerke <Bonn>. Seminarberichte. |
| title | On the computational complexity of program schemata |
| title_auth | On the computational complexity of program schemata |
| title_exact_search | On the computational complexity of program schemata |
| title_full | On the computational complexity of program schemata |
| title_fullStr | On the computational complexity of program schemata |
| title_full_unstemmed | On the computational complexity of program schemata |
| title_short | On the computational complexity of program schemata |
| title_sort | on the computational complexity of program schemata |
| volume_link | (DE-604)BV008909998 |
| work_keys_str_mv | AT weihrauchklaus onthecomputationalcomplexityofprogramschemata |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik, Berichte
| Signatur: |
0111 2001 B 6052-196 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |