Probabilistic NC1-circuits equal probabilistic polynomial time:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Deutsch |
| Veröffentlicht: |
Dortmund
1985
|
| Schriftenreihe: | Universität <Dortmund> / Abteilung Informatik: Forschungsbericht
194 |
| Schlagwörter: | |
| Umfang: | 10 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV000427612 | ||
| 003 | DE-604 | ||
| 005 | 20031028 | ||
| 007 | t| | ||
| 008 | 870612s1985 xx |||| 00||| ger d | ||
| 035 | |a (OCoLC)46058995 | ||
| 035 | |a (DE-599)BVBBV000427612 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-12 | ||
| 100 | 1 | |a Karpiński, Marek |d 1948- |e Verfasser |0 (DE-588)115476032 |4 aut | |
| 245 | 1 | 0 | |a Probabilistic NC1-circuits equal probabilistic polynomial time |c Marek Karpinski ; Rutger Verbeek |
| 246 | 1 | 3 | |a Probabilistic NC-circuits equal probabilistic polynomial time |
| 264 | 1 | |a Dortmund |c 1985 | |
| 300 | |a 10 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Dortmund> / Abteilung Informatik: Forschungsbericht |v 194 | |
| 650 | 7 | |a Komplexitätstheorie |2 swd | |
| 810 | 2 | |a Abteilung Informatik: Forschungsbericht |t Universität <Dortmund> |v 194 |w (DE-604)BV004082873 |9 194 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-000264606 | |
Datensatz im Suchindex
| _version_ | 1818943030785212417 |
|---|---|
| any_adam_object | |
| author | Karpiński, Marek 1948- |
| author_GND | (DE-588)115476032 |
| author_facet | Karpiński, Marek 1948- |
| author_role | aut |
| author_sort | Karpiński, Marek 1948- |
| author_variant | m k mk |
| building | Verbundindex |
| bvnumber | BV000427612 |
| ctrlnum | (OCoLC)46058995 (DE-599)BVBBV000427612 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01020nam a2200289 cb4500</leader><controlfield tag="001">BV000427612</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20031028 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">870612s1985 xx |||| 00||| ger d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)46058995</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV000427612</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">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Karpiński, Marek</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)115476032</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Probabilistic NC1-circuits equal probabilistic polynomial time</subfield><subfield code="c">Marek Karpinski ; Rutger Verbeek</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Probabilistic NC-circuits equal probabilistic polynomial time</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dortmund</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10 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">Universität <Dortmund> / Abteilung Informatik: Forschungsbericht</subfield><subfield code="v">194</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="2">swd</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Abteilung Informatik: Forschungsbericht</subfield><subfield code="t">Universität <Dortmund></subfield><subfield code="v">194</subfield><subfield code="w">(DE-604)BV004082873</subfield><subfield code="9">194</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-000264606</subfield></datafield></record></collection> |
| id | DE-604.BV000427612 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T07:20:51Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-000264606 |
| oclc_num | 46058995 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 10 S. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| record_format | marc |
| series2 | Universität <Dortmund> / Abteilung Informatik: Forschungsbericht |
| spelling | Karpiński, Marek 1948- Verfasser (DE-588)115476032 aut Probabilistic NC1-circuits equal probabilistic polynomial time Marek Karpinski ; Rutger Verbeek Probabilistic NC-circuits equal probabilistic polynomial time Dortmund 1985 10 S. txt rdacontent n rdamedia nc rdacarrier Universität <Dortmund> / Abteilung Informatik: Forschungsbericht 194 Komplexitätstheorie swd Abteilung Informatik: Forschungsbericht Universität <Dortmund> 194 (DE-604)BV004082873 194 |
| spellingShingle | Karpiński, Marek 1948- Probabilistic NC1-circuits equal probabilistic polynomial time Komplexitätstheorie swd |
| title | Probabilistic NC1-circuits equal probabilistic polynomial time |
| title_alt | Probabilistic NC-circuits equal probabilistic polynomial time |
| title_auth | Probabilistic NC1-circuits equal probabilistic polynomial time |
| title_exact_search | Probabilistic NC1-circuits equal probabilistic polynomial time |
| title_full | Probabilistic NC1-circuits equal probabilistic polynomial time Marek Karpinski ; Rutger Verbeek |
| title_fullStr | Probabilistic NC1-circuits equal probabilistic polynomial time Marek Karpinski ; Rutger Verbeek |
| title_full_unstemmed | Probabilistic NC1-circuits equal probabilistic polynomial time Marek Karpinski ; Rutger Verbeek |
| title_short | Probabilistic NC1-circuits equal probabilistic polynomial time |
| title_sort | probabilistic nc1 circuits equal probabilistic polynomial time |
| topic | Komplexitätstheorie swd |
| topic_facet | Komplexitätstheorie |
| volume_link | (DE-604)BV004082873 |
| work_keys_str_mv | AT karpinskimarek probabilisticnc1circuitsequalprobabilisticpolynomialtime AT karpinskimarek probabilisticnccircuitsequalprobabilisticpolynomialtime |