Relativization of the theory of computational complexity
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Project MAC
1972
|
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021879740 | ||
| 003 | DE-604 | ||
| 005 | 20120530 | ||
| 007 | t| | ||
| 008 | 880804s1972 xx m||| 00||| eng d | ||
| 035 | |a (OCoLC)2495602 | ||
| 035 | |a (DE-599)BVBBV021879740 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 |a DE-83 | ||
| 050 | 0 | |a QA76 | |
| 088 | |a MAC TR-99 | ||
| 100 | 1 | |a Lynch, Nancy A. |d 1948- |e Verfasser |0 (DE-588)121919625 |4 aut | |
| 245 | 1 | 0 | |a Relativization of the theory of computational complexity |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Project MAC |c 1972 | |
| 300 | |a 125 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Zugl.: Cambridge, Mass., Massachusetts Inst. of Technology, Diss., 1972 | ||
| 650 | 4 | |a Algorithmes | |
| 650 | 4 | |a Automates mathématiques, Théorie des | |
| 650 | 4 | |a Fonctions récursives | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Recursive functions | |
| 650 | 4 | |a Turing machines | |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Rekursionstheorie |0 (DE-588)4122329-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Rekursionstheorie |0 (DE-588)4122329-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-015095201 | |
Datensatz im Suchindex
| _version_ | 1819261709195411457 |
|---|---|
| any_adam_object | |
| author | Lynch, Nancy A. 1948- |
| author_GND | (DE-588)121919625 |
| author_facet | Lynch, Nancy A. 1948- |
| author_role | aut |
| author_sort | Lynch, Nancy A. 1948- |
| author_variant | n a l na nal |
| building | Verbundindex |
| bvnumber | BV021879740 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76 |
| callnumber-search | QA76 |
| callnumber-sort | QA 276 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)2495602 (DE-599)BVBBV021879740 |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01448nam a2200445zc 4500</leader><controlfield tag="001">BV021879740</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120530 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">880804s1972 xx m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)2495602</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021879740</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><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MAC TR-99</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lynch, Nancy A.</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121919625</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Relativization of the theory of computational complexity</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. of Technology, Project MAC</subfield><subfield code="c">1972</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">125 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="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Cambridge, Mass., Massachusetts Inst. of Technology, Diss., 1972</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automates mathématiques, Théorie des</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fonctions récursives</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursive functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Turing machines</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">Rekursionstheorie</subfield><subfield code="0">(DE-588)4122329-9</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">Rekursionstheorie</subfield><subfield code="0">(DE-588)4122329-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ät</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015095201</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV021879740 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-23T19:45:56Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015095201 |
| oclc_num | 2495602 |
| open_access_boolean | |
| owner | DE-706 DE-83 |
| owner_facet | DE-706 DE-83 |
| physical | 125 S. |
| publishDate | 1972 |
| publishDateSearch | 1972 |
| publishDateSort | 1972 |
| publisher | Mass. Inst. of Technology, Project MAC |
| record_format | marc |
| spelling | Lynch, Nancy A. 1948- Verfasser (DE-588)121919625 aut Relativization of the theory of computational complexity Cambridge, Mass. Mass. Inst. of Technology, Project MAC 1972 125 S. txt rdacontent n rdamedia nc rdacarrier Zugl.: Cambridge, Mass., Massachusetts Inst. of Technology, Diss., 1972 Algorithmes Automates mathématiques, Théorie des Fonctions récursives Algorithms Computational complexity Recursive functions Turing machines Komplexität (DE-588)4135369-9 gnd rswk-swf Rekursionstheorie (DE-588)4122329-9 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Rekursionstheorie (DE-588)4122329-9 s DE-604 Komplexität (DE-588)4135369-9 s |
| spellingShingle | Lynch, Nancy A. 1948- Relativization of the theory of computational complexity Algorithmes Automates mathématiques, Théorie des Fonctions récursives Algorithms Computational complexity Recursive functions Turing machines Komplexität (DE-588)4135369-9 gnd Rekursionstheorie (DE-588)4122329-9 gnd |
| subject_GND | (DE-588)4135369-9 (DE-588)4122329-9 (DE-588)4113937-9 |
| title | Relativization of the theory of computational complexity |
| title_auth | Relativization of the theory of computational complexity |
| title_exact_search | Relativization of the theory of computational complexity |
| title_full | Relativization of the theory of computational complexity |
| title_fullStr | Relativization of the theory of computational complexity |
| title_full_unstemmed | Relativization of the theory of computational complexity |
| title_short | Relativization of the theory of computational complexity |
| title_sort | relativization of the theory of computational complexity |
| topic | Algorithmes Automates mathématiques, Théorie des Fonctions récursives Algorithms Computational complexity Recursive functions Turing machines Komplexität (DE-588)4135369-9 gnd Rekursionstheorie (DE-588)4122329-9 gnd |
| topic_facet | Algorithmes Automates mathématiques, Théorie des Fonctions récursives Algorithms Computational complexity Recursive functions Turing machines Komplexität Rekursionstheorie Hochschulschrift |
| work_keys_str_mv | AT lynchnancya relativizationofthetheoryofcomputationalcomplexity |