An adequate reducibility concept for problems defined in terms of ordered binary decision diagrams:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Trier
Fachbereich IV, Mathematik, Informatik, Univ.
[19]96
|
| Schriftenreihe: | Trierer Forschungsberichte
96,2 |
| Schlagworte: | |
| Beschreibung: | 19 Bl. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV026155290 | ||
| 003 | DE-604 | ||
| 005 | 20110228 | ||
| 007 | t| | ||
| 008 | 110326s1996 xx d||| a||| 00||| und d | ||
| 035 | |a (OCoLC)75760653 | ||
| 035 | |a (DE-599)BVBBV026155290 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | |a und | ||
| 049 | |a DE-188 | ||
| 084 | |a SI 990 |0 (DE-625)143213: |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 Fachbereich IV, Mathematik, Informatik, Univ. |c [19]96 | |
| 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 Trierer Forschungsberichte |v 96,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 Sonstige |4 oth | |
| 830 | 0 | |a Trierer Forschungsberichte |v 96,2 |w (DE-604)BV026110061 |9 96,2 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-021742410 | |
Datensatz im Suchindex
| _version_ | 1820882545391173632 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Meinel, Christoph |
| author_facet | Meinel, Christoph |
| author_role | aut |
| author_sort | Meinel, Christoph |
| author_variant | c m cm |
| building | Verbundindex |
| bvnumber | BV026155290 |
| classification_rvk | SI 990 |
| ctrlnum | (OCoLC)75760653 (DE-599)BVBBV026155290 |
| discipline | 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">BV026155290</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20110228</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">110326s1996 xx d||| a||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75760653</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV026155290</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-188</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="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">Fachbereich IV, Mathematik, Informatik, Univ.</subfield><subfield code="c">[19]96</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">Trierer Forschungsberichte</subfield><subfield code="v">96,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">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Trierer Forschungsberichte</subfield><subfield code="v">96,2</subfield><subfield code="w">(DE-604)BV026110061</subfield><subfield code="9">96,2</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-021742410</subfield></datafield></record></collection> |
| id | DE-604.BV026155290 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T17:08:36Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-021742410 |
| oclc_num | 75760653 |
| open_access_boolean | |
| owner | DE-188 |
| owner_facet | DE-188 |
| physical | 19 Bl. graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Fachbereich IV, Mathematik, Informatik, Univ. |
| record_format | marc |
| series | Trierer Forschungsberichte |
| series2 | Trierer Forschungsberichte |
| spelling | Meinel, Christoph Verfasser aut An adequate reducibility concept for problems defined in terms of ordered binary decision diagrams Ch. Meinel ; A. Slobodova Trier Fachbereich IV, Mathematik, Informatik, Univ. [19]96 19 Bl. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Trierer Forschungsberichte 96,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 Sonstige oth Trierer Forschungsberichte 96,2 (DE-604)BV026110061 96,2 |
| spellingShingle | Meinel, Christoph An adequate reducibility concept for problems defined in terms of ordered binary decision diagrams Trierer Forschungsberichte 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)BV026110061 |
| work_keys_str_mv | AT meinelchristoph anadequatereducibilityconceptforproblemsdefinedintermsoforderedbinarydecisiondiagrams AT slobodovaanna anadequatereducibilityconceptforproblemsdefinedintermsoforderedbinarydecisiondiagrams |