An adequate reducibility concept for problems defined in terms of ordered binary decision diagrams:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Trier
Univ. Trier, Mathematik, Informatik
1996
|
| Schriftenreihe: | Mathematik, Informatik: Forschungsbericht Universität <Trier>
1996,2 |
| Schlagworte: | |
| Beschreibung: | 19 Bl. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010836032 | ||
| 003 | DE-604 | ||
| 005 | 19970415 | ||
| 007 | t | ||
| 008 | 960705s1996 d||| |||| 00||| eng d | ||
| 016 | 7 | |a 948035528 |2 DE-101 | |
| 035 | |a (OCoLC)75760653 | ||
| 035 | |a (DE-599)BVBBV010836032 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-19 |a DE-12 |a DE-473 |a DE-824 | ||
| 084 | |a SI 990 |0 (DE-625)143213: |2 rvk | ||
| 084 | |a SS 5567 |0 (DE-625)143565: |2 rvk | ||
| 100 | 1 | |a Meinel, Christoph |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An adequate reducibility concept for problems defined in terms of ordered binary decision diagrams |c Ch. Meinel, A. Slobodova |
| 264 | 1 | |a Trier |b Univ. Trier, Mathematik, Informatik |c 1996 | |
| 300 | |a 19 Bl. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Trier> / Mathematik, Informatik: Forschungsbericht |v 1996,2 | |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a OBDD |0 (DE-588)4389323-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | 1 | |a OBDD |0 (DE-588)4389323-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Slobodová, Anna |e Verfasser |4 aut | |
| 800 | 1 | |a Mathematik, Informatik: Forschungsbericht |t Universität <Trier> |v 1996,2 |w (DE-604)BV006128208 |9 1996,2 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007242999 | |
Datensatz im Suchindex
| _version_ | 1811034364003221504 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Meinel, Christoph Slobodová, Anna |
| author_facet | Meinel, Christoph Slobodová, Anna |
| author_role | aut aut |
| author_sort | Meinel, Christoph |
| author_variant | c m cm a s as |
| building | Verbundindex |
| bvnumber | BV010836032 |
| classification_rvk | SI 990 SS 5567 |
| ctrlnum | (OCoLC)75760653 (DE-599)BVBBV010836032 |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV010836032</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19970415</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960705s1996 d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">948035528</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75760653</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010836032</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-19</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-824</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 990</subfield><subfield code="0">(DE-625)143213:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 5567</subfield><subfield code="0">(DE-625)143565:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Meinel, Christoph</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An adequate reducibility concept for problems defined in terms of ordered binary decision diagrams</subfield><subfield code="c">Ch. Meinel, A. Slobodova</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Trier</subfield><subfield code="b">Univ. Trier, Mathematik, Informatik</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 Bl.</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">Universität <Trier> / Mathematik, Informatik: Forschungsbericht</subfield><subfield code="v">1996,2</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">OBDD</subfield><subfield code="0">(DE-588)4389323-5</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="1"><subfield code="a">OBDD</subfield><subfield code="0">(DE-588)4389323-5</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">Slobodová, Anna</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="800" ind1="1" ind2=" "><subfield code="a">Mathematik, Informatik: Forschungsbericht</subfield><subfield code="t">Universität <Trier></subfield><subfield code="v">1996,2</subfield><subfield code="w">(DE-604)BV006128208</subfield><subfield code="9">1996,2</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007242999</subfield></datafield></record></collection> |
| id | DE-604.BV010836032 |
| illustrated | Illustrated |
| indexdate | 2024-09-24T00:15:59Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007242999 |
| oclc_num | 75760653 |
| open_access_boolean | |
| owner | DE-19 DE-BY-UBM DE-12 DE-473 DE-BY-UBG DE-824 |
| owner_facet | DE-19 DE-BY-UBM DE-12 DE-473 DE-BY-UBG DE-824 |
| physical | 19 Bl. graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Univ. Trier, Mathematik, Informatik |
| record_format | marc |
| series | Mathematik, Informatik: Forschungsbericht Universität <Trier> |
| series2 | Universität <Trier> / Mathematik, Informatik: Forschungsbericht |
| spelling | Meinel, Christoph Verfasser aut An adequate reducibility concept for problems defined in terms of ordered binary decision diagrams Ch. Meinel, A. Slobodova Trier Univ. Trier, Mathematik, Informatik 1996 19 Bl. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Universität <Trier> / Mathematik, Informatik: Forschungsbericht 1996,2 Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf OBDD (DE-588)4389323-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 s OBDD (DE-588)4389323-5 s DE-604 Slobodová, Anna Verfasser aut Mathematik, Informatik: Forschungsbericht Universität <Trier> 1996,2 (DE-604)BV006128208 1996,2 |
| spellingShingle | Meinel, Christoph Slobodová, Anna An adequate reducibility concept for problems defined in terms of ordered binary decision diagrams Mathematik, Informatik: Forschungsbericht Universität <Trier> Komplexitätstheorie (DE-588)4120591-1 gnd OBDD (DE-588)4389323-5 gnd |
| subject_GND | (DE-588)4120591-1 (DE-588)4389323-5 |
| title | An adequate reducibility concept for problems defined in terms of ordered binary decision diagrams |
| title_auth | An adequate reducibility concept for problems defined in terms of ordered binary decision diagrams |
| title_exact_search | An adequate reducibility concept for problems defined in terms of ordered binary decision diagrams |
| title_full | An adequate reducibility concept for problems defined in terms of ordered binary decision diagrams Ch. Meinel, A. Slobodova |
| title_fullStr | An adequate reducibility concept for problems defined in terms of ordered binary decision diagrams Ch. Meinel, A. Slobodova |
| title_full_unstemmed | An adequate reducibility concept for problems defined in terms of ordered binary decision diagrams Ch. Meinel, A. Slobodova |
| title_short | An adequate reducibility concept for problems defined in terms of ordered binary decision diagrams |
| title_sort | an adequate reducibility concept for problems defined in terms of ordered binary decision diagrams |
| topic | Komplexitätstheorie (DE-588)4120591-1 gnd OBDD (DE-588)4389323-5 gnd |
| topic_facet | Komplexitätstheorie OBDD |
| volume_link | (DE-604)BV006128208 |
| work_keys_str_mv | AT meinelchristoph anadequatereducibilityconceptforproblemsdefinedintermsoforderedbinarydecisiondiagrams AT slobodovaanna anadequatereducibilityconceptforproblemsdefinedintermsoforderedbinarydecisiondiagrams |