What graphs can be efficiently represented by BDD?:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Halle
Martin-Luther-Univ., Fachbereich Mathematik und Informatik
2005
|
| Schriftenreihe: | Report / Martin-Luther-Universität Halle-Wittenberg, Fachbereich Mathematik und Informatik
2005,07 : Reports of the Institute for Computer Science |
| Beschreibung: | 16 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV025393535 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 100417s2005 d||| |||| 00||| ger d | ||
| 035 | |a (OCoLC)917528063 | ||
| 035 | |a (DE-599)BVBBV025393535 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-11 | ||
| 100 | 1 | |a Dong, C. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a What graphs can be efficiently represented by BDD? |c C. Dong and P. Molitor |
| 264 | 1 | |a Halle |b Martin-Luther-Univ., Fachbereich Mathematik und Informatik |c 2005 | |
| 300 | |a 16 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Report / Martin-Luther-Universität Halle-Wittenberg, Fachbereich Mathematik und Informatik |v 2005,07 : Reports of the Institute for Computer Science | |
| 700 | 1 | |a Molitor, Paul |d 1959- |e Verfasser |0 (DE-588)120699087 |4 aut | |
| 810 | 2 | |a Universität <Halle, Saale> |p Fachbereich für Mathematik und Informatik |t Report |v 2005,07 |w (DE-604)BV011207476 |9 2005,07 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-020016750 | ||
Datensatz im Suchindex
| _version_ | 1804142543540060160 |
|---|---|
| any_adam_object | |
| author | Dong, C. Molitor, Paul 1959- |
| author_GND | (DE-588)120699087 |
| author_facet | Dong, C. Molitor, Paul 1959- |
| author_role | aut aut |
| author_sort | Dong, C. |
| author_variant | c d cd p m pm |
| building | Verbundindex |
| bvnumber | BV025393535 |
| ctrlnum | (OCoLC)917528063 (DE-599)BVBBV025393535 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01088nam a2200277 cb4500</leader><controlfield tag="001">BV025393535</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100417s2005 d||| |||| 00||| ger d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)917528063</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV025393535</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="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dong, C.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">What graphs can be efficiently represented by BDD?</subfield><subfield code="c">C. Dong and P. Molitor</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Halle</subfield><subfield code="b">Martin-Luther-Univ., Fachbereich Mathematik und Informatik</subfield><subfield code="c">2005</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 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">Report / Martin-Luther-Universität Halle-Wittenberg, Fachbereich Mathematik und Informatik</subfield><subfield code="v">2005,07 : Reports of the Institute for Computer Science</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Molitor, Paul</subfield><subfield code="d">1959-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120699087</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Universität <Halle, Saale> </subfield><subfield code="p">Fachbereich für Mathematik und Informatik</subfield><subfield code="t">Report</subfield><subfield code="v">2005,07</subfield><subfield code="w">(DE-604)BV011207476</subfield><subfield code="9">2005,07</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-020016750</subfield></datafield></record></collection> |
| id | DE-604.BV025393535 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:33:26Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020016750 |
| oclc_num | 917528063 |
| open_access_boolean | |
| owner | DE-11 |
| owner_facet | DE-11 |
| physical | 16 S. graph. Darst. |
| publishDate | 2005 |
| publishDateSearch | 2005 |
| publishDateSort | 2005 |
| publisher | Martin-Luther-Univ., Fachbereich Mathematik und Informatik |
| record_format | marc |
| series2 | Report / Martin-Luther-Universität Halle-Wittenberg, Fachbereich Mathematik und Informatik |
| spelling | Dong, C. Verfasser aut What graphs can be efficiently represented by BDD? C. Dong and P. Molitor Halle Martin-Luther-Univ., Fachbereich Mathematik und Informatik 2005 16 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Report / Martin-Luther-Universität Halle-Wittenberg, Fachbereich Mathematik und Informatik 2005,07 : Reports of the Institute for Computer Science Molitor, Paul 1959- Verfasser (DE-588)120699087 aut Universität <Halle, Saale> Fachbereich für Mathematik und Informatik Report 2005,07 (DE-604)BV011207476 2005,07 |
| spellingShingle | Dong, C. Molitor, Paul 1959- What graphs can be efficiently represented by BDD? |
| title | What graphs can be efficiently represented by BDD? |
| title_auth | What graphs can be efficiently represented by BDD? |
| title_exact_search | What graphs can be efficiently represented by BDD? |
| title_full | What graphs can be efficiently represented by BDD? C. Dong and P. Molitor |
| title_fullStr | What graphs can be efficiently represented by BDD? C. Dong and P. Molitor |
| title_full_unstemmed | What graphs can be efficiently represented by BDD? C. Dong and P. Molitor |
| title_short | What graphs can be efficiently represented by BDD? |
| title_sort | what graphs can be efficiently represented by bdd |
| volume_link | (DE-604)BV011207476 |
| work_keys_str_mv | AT dongc whatgraphscanbeefficientlyrepresentedbybdd AT molitorpaul whatgraphscanbeefficientlyrepresentedbybdd |