Probabilistic NC-circuits equal probabilistic polynomial time:
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Dortmund
Univ.
1985
|
Schriftenreihe: | Forschungsbericht / Abteilung Informatik, Universität Dortmund
194 |
Schlagworte: | |
Beschreibung: | 10 S. graph.Darst. |
Internformat
MARC
LEADER | 00000nam a2200000zcb4500 | ||
---|---|---|---|
001 | BV022187435 | ||
003 | DE-604 | ||
005 | 20211019 | ||
007 | t | ||
008 | 861126s1985 d||| |||| 00||| eng d | ||
035 | |a (OCoLC)46058995 | ||
035 | |a (DE-599)BVBBV022187435 | ||
040 | |a DE-604 |b ger | ||
041 | 0 | |a eng | |
049 | |a DE-706 | ||
100 | 1 | |a Karpiński, Marek |d 1948- |e Verfasser |0 (DE-588)115476032 |4 aut | |
245 | 1 | 0 | |a Probabilistic NC-circuits equal probabilistic polynomial time |c Marek Karpinski ; Rutger Verbeek |
264 | 1 | |a Dortmund |b Univ. |c 1985 | |
300 | |a 10 S. |b graph.Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Forschungsbericht / Abteilung Informatik, Universität Dortmund |v 194 | |
650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Verbeek, Rutger |e Verfasser |4 aut | |
810 | 2 | |a Abteilung Informatik, Universität Dortmund |t Forschungsbericht |v 194 |w (DE-604)BV004082873 |9 194 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-015402214 |
Datensatz im Suchindex
_version_ | 1804136163206758400 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Karpiński, Marek 1948- Verbeek, Rutger |
author_GND | (DE-588)115476032 |
author_facet | Karpiński, Marek 1948- Verbeek, Rutger |
author_role | aut aut |
author_sort | Karpiński, Marek 1948- |
author_variant | m k mk r v rv |
building | Verbundindex |
bvnumber | BV022187435 |
ctrlnum | (OCoLC)46058995 (DE-599)BVBBV022187435 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01109nam a2200313zcb4500</leader><controlfield tag="001">BV022187435</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20211019 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">861126s1985 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)46058995</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022187435</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></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 NC-circuits equal probabilistic polynomial time</subfield><subfield code="c">Marek Karpinski ; Rutger Verbeek</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dortmund</subfield><subfield code="b">Univ.</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10 S.</subfield><subfield code="b">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="490" ind1="1" ind2=" "><subfield code="a">Forschungsbericht / Abteilung Informatik, Universität Dortmund</subfield><subfield code="v">194</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="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Verbeek, Rutger</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Abteilung Informatik, Universität Dortmund</subfield><subfield code="t">Forschungsbericht</subfield><subfield code="v">194</subfield><subfield code="w">(DE-604)BV004082873</subfield><subfield code="9">194</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015402214</subfield></datafield></record></collection> |
id | DE-604.BV022187435 |
illustrated | Illustrated |
index_date | 2024-07-02T16:21:04Z |
indexdate | 2024-07-09T20:52:02Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015402214 |
oclc_num | 46058995 |
open_access_boolean | |
owner | DE-706 |
owner_facet | DE-706 |
physical | 10 S. graph.Darst. |
publishDate | 1985 |
publishDateSearch | 1985 |
publishDateSort | 1985 |
publisher | Univ. |
record_format | marc |
series2 | Forschungsbericht / Abteilung Informatik, Universität Dortmund |
spelling | Karpiński, Marek 1948- Verfasser (DE-588)115476032 aut Probabilistic NC-circuits equal probabilistic polynomial time Marek Karpinski ; Rutger Verbeek Dortmund Univ. 1985 10 S. graph.Darst. txt rdacontent n rdamedia nc rdacarrier Forschungsbericht / Abteilung Informatik, Universität Dortmund 194 Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 s DE-604 Verbeek, Rutger Verfasser aut Abteilung Informatik, Universität Dortmund Forschungsbericht 194 (DE-604)BV004082873 194 |
spellingShingle | Karpiński, Marek 1948- Verbeek, Rutger Probabilistic NC-circuits equal probabilistic polynomial time Komplexitätstheorie (DE-588)4120591-1 gnd |
subject_GND | (DE-588)4120591-1 |
title | Probabilistic NC-circuits equal probabilistic polynomial time |
title_auth | Probabilistic NC-circuits equal probabilistic polynomial time |
title_exact_search | Probabilistic NC-circuits equal probabilistic polynomial time |
title_exact_search_txtP | Probabilistic NC-circuits equal probabilistic polynomial time |
title_full | Probabilistic NC-circuits equal probabilistic polynomial time Marek Karpinski ; Rutger Verbeek |
title_fullStr | Probabilistic NC-circuits equal probabilistic polynomial time Marek Karpinski ; Rutger Verbeek |
title_full_unstemmed | Probabilistic NC-circuits equal probabilistic polynomial time Marek Karpinski ; Rutger Verbeek |
title_short | Probabilistic NC-circuits equal probabilistic polynomial time |
title_sort | probabilistic nc circuits equal probabilistic polynomial time |
topic | Komplexitätstheorie (DE-588)4120591-1 gnd |
topic_facet | Komplexitätstheorie |
volume_link | (DE-604)BV004082873 |
work_keys_str_mv | AT karpinskimarek probabilisticnccircuitsequalprobabilisticpolynomialtime AT verbeekrutger probabilisticnccircuitsequalprobabilisticpolynomialtime |