Proceedings: May 24 - 27, 1996, Pennsylvania
Gespeichert in:
| Körperschaft: | |
|---|---|
| Format: | Tagungsbericht Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Los Angeles, Calif. [u.a.]
IEEE Computer Soc. Press
1996
|
| Schlagworte: | |
| Beschreibung: | X, 307 S. Ill., graph. Darst. |
| ISBN: | 0818673869 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV011020203 | ||
| 003 | DE-604 | ||
| 007 | t| | ||
| 008 | 961023s1996 xx ad|| |||| 10||| und d | ||
| 020 | |a 0818673869 |9 0-8186-7386-9 | ||
| 035 | |a (OCoLC)633562857 | ||
| 035 | |a (DE-599)BVBBV011020203 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-739 | ||
| 111 | 2 | |a Conference on Computational Complexity |n 11 |d 1996 |c Philadelphia, Pa. |j Verfasser |0 (DE-588)5187334-5 |4 aut | |
| 245 | 1 | 0 | |a Proceedings |b May 24 - 27, 1996, Pennsylvania |c eleventh annual IEEE Conference on Computational Complexity (formerly: Structure in Complexity Theory Conference) ; ed. by Steve Homer ... |
| 246 | 1 | 3 | |a Computational complexity |
| 264 | 1 | |a Los Angeles, Calif. [u.a.] |b IEEE Computer Soc. Press |c 1996 | |
| 300 | |a X, 307 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 0 | 7 | |a Formale Sprache |0 (DE-588)4017848-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datennetz |0 (DE-588)4011130-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenstruktur |0 (DE-588)4011146-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Telekommunikationsnetz |0 (DE-588)4133586-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmentheorie |0 (DE-588)4200409-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Datenstruktur |0 (DE-588)4011146-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 3 | |5 DE-604 | |
| 689 | 4 | 0 | |a Algorithmentheorie |0 (DE-588)4200409-3 |D s |
| 689 | 4 | |5 DE-604 | |
| 689 | 5 | 0 | |a Telekommunikationsnetz |0 (DE-588)4133586-7 |D s |
| 689 | 5 | |8 1\p |5 DE-604 | |
| 689 | 6 | 0 | |a Datennetz |0 (DE-588)4011130-1 |D s |
| 689 | 6 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Homer, Steve |e Sonstige |4 oth | |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\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-007377599 | |
Datensatz im Suchindex
| _version_ | 1820868192104349696 |
|---|---|
| adam_text | |
| any_adam_object | |
| author_corporate | Conference on Computational Complexity Philadelphia, Pa |
| author_corporate_role | aut |
| author_facet | Conference on Computational Complexity Philadelphia, Pa |
| author_sort | Conference on Computational Complexity Philadelphia, Pa |
| building | Verbundindex |
| bvnumber | BV011020203 |
| classification_rvk | SS 1996 |
| ctrlnum | (OCoLC)633562857 (DE-599)BVBBV011020203 |
| discipline | Informatik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV011020203</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">961023s1996 xx ad|| |||| 10||| und d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0818673869</subfield><subfield code="9">0-8186-7386-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)633562857</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011020203</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-739</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">Conference on Computational Complexity</subfield><subfield code="n">11</subfield><subfield code="d">1996</subfield><subfield code="c">Philadelphia, Pa.</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)5187334-5</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proceedings</subfield><subfield code="b">May 24 - 27, 1996, Pennsylvania</subfield><subfield code="c">eleventh annual IEEE Conference on Computational Complexity (formerly: Structure in Complexity Theory Conference) ; ed. by Steve Homer ...</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Los Angeles, Calif. [u.a.]</subfield><subfield code="b">IEEE Computer Soc. Press</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 307 S.</subfield><subfield code="b">Ill., graph. Darst.</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="650" ind1="0" ind2="7"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datennetz</subfield><subfield code="0">(DE-588)4011130-1</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="650" ind1="0" ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Telekommunikationsnetz</subfield><subfield code="0">(DE-588)4133586-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-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)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</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">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Telekommunikationsnetz</subfield><subfield code="0">(DE-588)4133586-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="6" ind2="0"><subfield code="a">Datennetz</subfield><subfield code="0">(DE-588)4011130-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="6" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Homer, Steve</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</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="883" ind1="1" ind2=" "><subfield code="8">2\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-007377599</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV011020203 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T13:20:25Z |
| institution | BVB |
| institution_GND | (DE-588)5187334-5 |
| isbn | 0818673869 |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007377599 |
| oclc_num | 633562857 |
| open_access_boolean | |
| owner | DE-739 |
| owner_facet | DE-739 |
| physical | X, 307 S. Ill., graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | IEEE Computer Soc. Press |
| record_format | marc |
| spelling | Conference on Computational Complexity 11 1996 Philadelphia, Pa. Verfasser (DE-588)5187334-5 aut Proceedings May 24 - 27, 1996, Pennsylvania eleventh annual IEEE Conference on Computational Complexity (formerly: Structure in Complexity Theory Conference) ; ed. by Steve Homer ... Computational complexity Los Angeles, Calif. [u.a.] IEEE Computer Soc. Press 1996 X, 307 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Formale Sprache (DE-588)4017848-1 gnd rswk-swf Datennetz (DE-588)4011130-1 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Datenstruktur (DE-588)4011146-5 gnd rswk-swf Telekommunikationsnetz (DE-588)4133586-7 gnd rswk-swf Algorithmentheorie (DE-588)4200409-3 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf (DE-588)1071861417 Konferenzschrift gnd-content Datenstruktur (DE-588)4011146-5 s DE-604 Formale Sprache (DE-588)4017848-1 s Komplexitätstheorie (DE-588)4120591-1 s Berechnungskomplexität (DE-588)4134751-1 s Algorithmentheorie (DE-588)4200409-3 s Telekommunikationsnetz (DE-588)4133586-7 s 1\p DE-604 Datennetz (DE-588)4011130-1 s 2\p DE-604 Homer, Steve Sonstige oth 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Proceedings May 24 - 27, 1996, Pennsylvania Formale Sprache (DE-588)4017848-1 gnd Datennetz (DE-588)4011130-1 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Datenstruktur (DE-588)4011146-5 gnd Telekommunikationsnetz (DE-588)4133586-7 gnd Algorithmentheorie (DE-588)4200409-3 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4017848-1 (DE-588)4011130-1 (DE-588)4120591-1 (DE-588)4011146-5 (DE-588)4133586-7 (DE-588)4200409-3 (DE-588)4134751-1 (DE-588)1071861417 |
| title | Proceedings May 24 - 27, 1996, Pennsylvania |
| title_alt | Computational complexity |
| title_auth | Proceedings May 24 - 27, 1996, Pennsylvania |
| title_exact_search | Proceedings May 24 - 27, 1996, Pennsylvania |
| title_full | Proceedings May 24 - 27, 1996, Pennsylvania eleventh annual IEEE Conference on Computational Complexity (formerly: Structure in Complexity Theory Conference) ; ed. by Steve Homer ... |
| title_fullStr | Proceedings May 24 - 27, 1996, Pennsylvania eleventh annual IEEE Conference on Computational Complexity (formerly: Structure in Complexity Theory Conference) ; ed. by Steve Homer ... |
| title_full_unstemmed | Proceedings May 24 - 27, 1996, Pennsylvania eleventh annual IEEE Conference on Computational Complexity (formerly: Structure in Complexity Theory Conference) ; ed. by Steve Homer ... |
| title_short | Proceedings |
| title_sort | proceedings may 24 27 1996 pennsylvania |
| title_sub | May 24 - 27, 1996, Pennsylvania |
| topic | Formale Sprache (DE-588)4017848-1 gnd Datennetz (DE-588)4011130-1 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Datenstruktur (DE-588)4011146-5 gnd Telekommunikationsnetz (DE-588)4133586-7 gnd Algorithmentheorie (DE-588)4200409-3 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Formale Sprache Datennetz Komplexitätstheorie Datenstruktur Telekommunikationsnetz Algorithmentheorie Berechnungskomplexität Konferenzschrift |
| work_keys_str_mv | AT conferenceoncomputationalcomplexityphiladelphiapa proceedingsmay24271996pennsylvania AT homersteve proceedingsmay24271996pennsylvania AT conferenceoncomputationalcomplexityphiladelphiapa computationalcomplexity AT homersteve computationalcomplexity |