Some elementary proofs of lower-bounds in complexity theory:
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Amsterdam
1975
|
Ausgabe: | Prepubl. (rev.) |
Schriftenreihe: | Mathematisch Centrum <Amsterdam> / Afdeling Informatica: IW
41 |
Beschreibung: | 20 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV009667023 | ||
003 | DE-604 | ||
005 | 19940623 | ||
007 | t | ||
008 | 940623s1975 |||| 00||| engod | ||
035 | |a (OCoLC)65549864 | ||
035 | |a (DE-599)BVBBV009667023 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
100 | 1 | |a Leewen, Jan van |e Verfasser |4 aut | |
245 | 1 | 0 | |a Some elementary proofs of lower-bounds in complexity theory |c J. van Leewen & P. van Emde Boas |
250 | |a Prepubl. (rev.) | ||
264 | 1 | |a Amsterdam |c 1975 | |
300 | |a 20 S. | ||
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 41 | |
700 | 1 | |a Emde Boas, Peter van |e Verfasser |4 aut | |
810 | 2 | |a Afdeling Informatica: IW |t Mathematisch Centrum <Amsterdam> |v 41 |w (DE-604)BV009666067 |9 41 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006392871 |
Datensatz im Suchindex
_version_ | 1804124011695702016 |
---|---|
any_adam_object | |
author | Leewen, Jan van Emde Boas, Peter van |
author_facet | Leewen, Jan van Emde Boas, Peter van |
author_role | aut aut |
author_sort | Leewen, Jan van |
author_variant | j v l jv jvl b p v e bpv bpve |
building | Verbundindex |
bvnumber | BV009667023 |
ctrlnum | (OCoLC)65549864 (DE-599)BVBBV009667023 |
edition | Prepubl. (rev.) |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00917nam a2200277 cb4500</leader><controlfield tag="001">BV009667023</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940623 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940623s1975 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)65549864</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009667023</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="100" ind1="1" ind2=" "><subfield code="a">Leewen, Jan van</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Some elementary proofs of lower-bounds in complexity theory</subfield><subfield code="c">J. van Leewen & P. van Emde Boas</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Prepubl. (rev.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1975</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 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">Mathematisch Centrum <Amsterdam> / Afdeling Informatica: IW</subfield><subfield code="v">41</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Emde Boas, Peter van</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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">41</subfield><subfield code="w">(DE-604)BV009666067</subfield><subfield code="9">41</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006392871</subfield></datafield></record></collection> |
id | DE-604.BV009667023 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:38:53Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006392871 |
oclc_num | 65549864 |
open_access_boolean | |
physical | 20 S. |
publishDate | 1975 |
publishDateSearch | 1975 |
publishDateSort | 1975 |
record_format | marc |
series2 | Mathematisch Centrum <Amsterdam> / Afdeling Informatica: IW |
spelling | Leewen, Jan van Verfasser aut Some elementary proofs of lower-bounds in complexity theory J. van Leewen & P. van Emde Boas Prepubl. (rev.) Amsterdam 1975 20 S. txt rdacontent n rdamedia nc rdacarrier Mathematisch Centrum <Amsterdam> / Afdeling Informatica: IW 41 Emde Boas, Peter van Verfasser aut Afdeling Informatica: IW Mathematisch Centrum <Amsterdam> 41 (DE-604)BV009666067 41 |
spellingShingle | Leewen, Jan van Emde Boas, Peter van Some elementary proofs of lower-bounds in complexity theory |
title | Some elementary proofs of lower-bounds in complexity theory |
title_auth | Some elementary proofs of lower-bounds in complexity theory |
title_exact_search | Some elementary proofs of lower-bounds in complexity theory |
title_full | Some elementary proofs of lower-bounds in complexity theory J. van Leewen & P. van Emde Boas |
title_fullStr | Some elementary proofs of lower-bounds in complexity theory J. van Leewen & P. van Emde Boas |
title_full_unstemmed | Some elementary proofs of lower-bounds in complexity theory J. van Leewen & P. van Emde Boas |
title_short | Some elementary proofs of lower-bounds in complexity theory |
title_sort | some elementary proofs of lower bounds in complexity theory |
volume_link | (DE-604)BV009666067 |
work_keys_str_mv | AT leewenjanvan someelementaryproofsoflowerboundsincomplexitytheory AT emdeboaspetervan someelementaryproofsoflowerboundsincomplexitytheory |