An N1.618 lower bound on the time to simulate one queue or two pushdown stores by one tape:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1983
|
| Ausgabe: | Preprint |
| Schriftenreihe: | Mathematisch Centrum <Amsterdam> / Afdeling Informatica: IW
245 |
| Schlagworte: | |
| Beschreibung: | 5 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010204936 | ||
| 003 | DE-604 | ||
| 005 | 20070713 | ||
| 007 | t | ||
| 008 | 950530s1983 |||| 00||| engod | ||
| 035 | |a (OCoLC)256174622 | ||
| 035 | |a (DE-599)BVBBV010204936 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 100 | 1 | |a Vitányi, Paul M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An N1.618 lower bound on the time to simulate one queue or two pushdown stores by one tape |c P. M. B. Vitányi |
| 250 | |a Preprint | ||
| 264 | 1 | |a Amsterdam |c 1983 | |
| 300 | |a 5 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Mathematisch Centrum <Amsterdam> / Afdeling Informatica: IW |v 245 | |
| 650 | 0 | 7 | |a Magnetbandspeicher |0 (DE-588)4168550-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Turing-Maschine |0 (DE-588)4203525-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 0 | 1 | |a Magnetbandspeicher |0 (DE-588)4168550-7 |D s |
| 689 | 0 | 2 | |a Turing-Maschine |0 (DE-588)4203525-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 810 | 2 | |a Afdeling Informatica: IW |t Mathematisch Centrum <Amsterdam> |v 245 |w (DE-604)BV009666067 |9 245 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006780363 | ||
Datensatz im Suchindex
| _version_ | 1804124609622048768 |
|---|---|
| any_adam_object | |
| author | Vitányi, Paul M. |
| author_facet | Vitányi, Paul M. |
| author_role | aut |
| author_sort | Vitányi, Paul M. |
| author_variant | p m v pm pmv |
| building | Verbundindex |
| bvnumber | BV010204936 |
| ctrlnum | (OCoLC)256174622 (DE-599)BVBBV010204936 |
| edition | Preprint |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01289nam a2200361 cb4500</leader><controlfield tag="001">BV010204936</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20070713 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950530s1983 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)256174622</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010204936</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-706</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Vitányi, Paul M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An N1.618 lower bound on the time to simulate one queue or two pushdown stores by one tape</subfield><subfield code="c">P. M. B. Vitányi</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Preprint</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1983</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">5 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">Mathematisch Centrum <Amsterdam> / Afdeling Informatica: IW</subfield><subfield code="v">245</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Magnetbandspeicher</subfield><subfield code="0">(DE-588)4168550-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Turing-Maschine</subfield><subfield code="0">(DE-588)4203525-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Magnetbandspeicher</subfield><subfield code="0">(DE-588)4168550-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Turing-Maschine</subfield><subfield code="0">(DE-588)4203525-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Afdeling Informatica: IW</subfield><subfield code="t">Mathematisch Centrum <Amsterdam></subfield><subfield code="v">245</subfield><subfield code="w">(DE-604)BV009666067</subfield><subfield code="9">245</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006780363</subfield></datafield></record></collection> |
| id | DE-604.BV010204936 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:48:23Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006780363 |
| oclc_num | 256174622 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 5 Bl. |
| publishDate | 1983 |
| publishDateSearch | 1983 |
| publishDateSort | 1983 |
| record_format | marc |
| series2 | Mathematisch Centrum <Amsterdam> / Afdeling Informatica: IW |
| spelling | Vitányi, Paul M. Verfasser aut An N1.618 lower bound on the time to simulate one queue or two pushdown stores by one tape P. M. B. Vitányi Preprint Amsterdam 1983 5 Bl. txt rdacontent n rdamedia nc rdacarrier Mathematisch Centrum <Amsterdam> / Afdeling Informatica: IW 245 Magnetbandspeicher (DE-588)4168550-7 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Turing-Maschine (DE-588)4203525-9 gnd rswk-swf Komplexität (DE-588)4135369-9 s Magnetbandspeicher (DE-588)4168550-7 s Turing-Maschine (DE-588)4203525-9 s DE-604 Afdeling Informatica: IW Mathematisch Centrum <Amsterdam> 245 (DE-604)BV009666067 245 |
| spellingShingle | Vitányi, Paul M. An N1.618 lower bound on the time to simulate one queue or two pushdown stores by one tape Magnetbandspeicher (DE-588)4168550-7 gnd Komplexität (DE-588)4135369-9 gnd Turing-Maschine (DE-588)4203525-9 gnd |
| subject_GND | (DE-588)4168550-7 (DE-588)4135369-9 (DE-588)4203525-9 |
| title | An N1.618 lower bound on the time to simulate one queue or two pushdown stores by one tape |
| title_auth | An N1.618 lower bound on the time to simulate one queue or two pushdown stores by one tape |
| title_exact_search | An N1.618 lower bound on the time to simulate one queue or two pushdown stores by one tape |
| title_full | An N1.618 lower bound on the time to simulate one queue or two pushdown stores by one tape P. M. B. Vitányi |
| title_fullStr | An N1.618 lower bound on the time to simulate one queue or two pushdown stores by one tape P. M. B. Vitányi |
| title_full_unstemmed | An N1.618 lower bound on the time to simulate one queue or two pushdown stores by one tape P. M. B. Vitányi |
| title_short | An N1.618 lower bound on the time to simulate one queue or two pushdown stores by one tape |
| title_sort | an n1 618 lower bound on the time to simulate one queue or two pushdown stores by one tape |
| topic | Magnetbandspeicher (DE-588)4168550-7 gnd Komplexität (DE-588)4135369-9 gnd Turing-Maschine (DE-588)4203525-9 gnd |
| topic_facet | Magnetbandspeicher Komplexität Turing-Maschine |
| volume_link | (DE-604)BV009666067 |
| work_keys_str_mv | AT vitanyipaulm ann1618lowerboundonthetimetosimulateonequeueortwopushdownstoresbyonetape |