Computational limitations of small-depth circuits:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge, Mass. u.a.
MIT Pr.
1987
|
| Schriftenreihe: | Association for Computing Machinery: ACM doctoral dissertation awards.
1986,2. |
| Schlagwörter: | |
| Beschreibung: | Zugl.: Cambridge, Mass., Massachusetts Inst. of Technology, Diss., 1986 |
| Umfang: | 82 S. |
| ISBN: | 0262081679 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV002301368 | ||
| 003 | DE-604 | ||
| 005 | 20171201 | ||
| 007 | t| | ||
| 008 | 890928s1987 xx m||| 00||| eng d | ||
| 020 | |a 0262081679 |9 0-262-08167-9 | ||
| 035 | |a (OCoLC)438513634 | ||
| 035 | |a (DE-599)BVBBV002301368 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-384 |a DE-739 |a DE-20 | ||
| 080 | |a 51 | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 190 |0 (DE-625)143607: |2 rvk | ||
| 084 | |a DAT 517d |2 stub | ||
| 100 | 1 | |a Håstad, Torkel Johan |d 1960- |e Verfasser |0 (DE-588)1082328707 |4 aut | |
| 245 | 1 | 0 | |a Computational limitations of small-depth circuits |
| 264 | 1 | |a Cambridge, Mass. u.a. |b MIT Pr. |c 1987 | |
| 300 | |a 82 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Association for Computing Machinery: ACM doctoral dissertation awards. |v 1986,2. | |
| 500 | |a Zugl.: Cambridge, Mass., Massachusetts Inst. of Technology, Diss., 1986 | ||
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Logische Schaltung |0 (DE-588)4131023-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Logische Schaltung |0 (DE-588)4131023-8 |D s |
| 689 | 0 | 1 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 830 | 0 | |a Association for Computing Machinery: ACM doctoral dissertation awards. |v 1986,2. |w (DE-604)BV000012532 |9 1986,2. | |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-001512451 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0102 DAT 517d 2001 A 19752 |
|---|---|
| DE-BY-TUM_katkey | 390661 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040020064880 |
| _version_ | 1821937015349837824 |
| any_adam_object | |
| author | Håstad, Torkel Johan 1960- |
| author_GND | (DE-588)1082328707 |
| author_facet | Håstad, Torkel Johan 1960- |
| author_role | aut |
| author_sort | Håstad, Torkel Johan 1960- |
| author_variant | t j h tj tjh |
| building | Verbundindex |
| bvnumber | BV002301368 |
| classification_rvk | ST 130 ST 190 |
| classification_tum | DAT 517d |
| ctrlnum | (OCoLC)438513634 (DE-599)BVBBV002301368 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01770nam a2200457 cb4500</leader><controlfield tag="001">BV002301368</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20171201 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">890928s1987 xx m||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262081679</subfield><subfield code="9">0-262-08167-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)438513634</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002301368</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-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield></datafield><datafield tag="080" ind1=" " ind2=" "><subfield code="a">51</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 190</subfield><subfield code="0">(DE-625)143607:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Håstad, Torkel Johan</subfield><subfield code="d">1960-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1082328707</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computational limitations of small-depth circuits</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass. u.a.</subfield><subfield code="b">MIT Pr.</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">82 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">Association for Computing Machinery: ACM doctoral dissertation awards.</subfield><subfield code="v">1986,2.</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Cambridge, Mass., Massachusetts Inst. of Technology, Diss., 1986</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">Logische Schaltung</subfield><subfield code="0">(DE-588)4131023-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Logische Schaltung</subfield><subfield code="0">(DE-588)4131023-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Association for Computing Machinery: ACM doctoral dissertation awards.</subfield><subfield code="v">1986,2.</subfield><subfield code="w">(DE-604)BV000012532</subfield><subfield code="9">1986,2.</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001512451</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV002301368 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T07:49:09Z |
| institution | BVB |
| isbn | 0262081679 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001512451 |
| oclc_num | 438513634 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-384 DE-739 DE-20 |
| owner_facet | DE-91G DE-BY-TUM DE-384 DE-739 DE-20 |
| physical | 82 S. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| publisher | MIT Pr. |
| record_format | marc |
| series | Association for Computing Machinery: ACM doctoral dissertation awards. |
| series2 | Association for Computing Machinery: ACM doctoral dissertation awards. |
| spellingShingle | Håstad, Torkel Johan 1960- Computational limitations of small-depth circuits Association for Computing Machinery: ACM doctoral dissertation awards. Komplexität (DE-588)4135369-9 gnd Logische Schaltung (DE-588)4131023-8 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| subject_GND | (DE-588)4135369-9 (DE-588)4131023-8 (DE-588)4120591-1 (DE-588)4113937-9 |
| title | Computational limitations of small-depth circuits |
| title_auth | Computational limitations of small-depth circuits |
| title_exact_search | Computational limitations of small-depth circuits |
| title_full | Computational limitations of small-depth circuits |
| title_fullStr | Computational limitations of small-depth circuits |
| title_full_unstemmed | Computational limitations of small-depth circuits |
| title_short | Computational limitations of small-depth circuits |
| title_sort | computational limitations of small depth circuits |
| topic | Komplexität (DE-588)4135369-9 gnd Logische Schaltung (DE-588)4131023-8 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| topic_facet | Komplexität Logische Schaltung Komplexitätstheorie Hochschulschrift |
| volume_link | (DE-604)BV000012532 |
| work_keys_str_mv | AT hastadtorkeljohan computationallimitationsofsmalldepthcircuits |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik
| Signatur: |
0102 DAT 517d 2001 A 19752 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |