Graph partitioning and constructing optimal decision trees are polynomial complete problems:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Rocquencourt
IRIA
1973
|
| Schriftenreihe: | Institut de Recherche d'Informatique et d'Automatique <Rocquencourt> / Laboratoire de Recherche: Rapport de recherche
33 |
| Schlagworte: | |
| Beschreibung: | 9 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009050898 | ||
| 003 | DE-604 | ||
| 005 | 19941130 | ||
| 007 | t| | ||
| 008 | 940227s1973 xx |||| 00||| und d | ||
| 035 | |a (OCoLC)634635087 | ||
| 035 | |a (DE-599)BVBBV009050898 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-91G | ||
| 100 | 1 | |a Hyafil, Laurent |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Graph partitioning and constructing optimal decision trees are polynomial complete problems |c Laurent Hyafil ; R. L. Rivest* |
| 264 | 1 | |a Rocquencourt |b IRIA |c 1973 | |
| 300 | |a 9 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Institut de Recherche d'Informatique et d'Automatique <Rocquencourt> / Laboratoire de Recherche: Rapport de recherche |v 33 | |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Rivest, R. L. |e Verfasser |4 aut | |
| 810 | 2 | |a Laboratoire de Recherche: Rapport de recherche |t Institut de Recherche d'Informatique et d'Automatique <Rocquencourt> |v 33 |w (DE-604)BV008910398 |9 33 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005990660 | |
Datensatz im Suchindex
| _version_ | 1817318943971344384 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Hyafil, Laurent Rivest, R. L. |
| author_facet | Hyafil, Laurent Rivest, R. L. |
| author_role | aut aut |
| author_sort | Hyafil, Laurent |
| author_variant | l h lh r l r rl rlr |
| building | Verbundindex |
| bvnumber | BV009050898 |
| ctrlnum | (OCoLC)634635087 (DE-599)BVBBV009050898 |
| 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">BV009050898</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19941130</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940227s1973 xx |||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)634635087</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009050898</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hyafil, Laurent</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph partitioning and constructing optimal decision trees are polynomial complete problems</subfield><subfield code="c">Laurent Hyafil ; R. L. Rivest*</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Rocquencourt</subfield><subfield code="b">IRIA</subfield><subfield code="c">1973</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9 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">Institut de Recherche d'Informatique et d'Automatique <Rocquencourt> / Laboratoire de Recherche: Rapport de recherche</subfield><subfield code="v">33</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</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">Rivest, R. L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Laboratoire de Recherche: Rapport de recherche</subfield><subfield code="t">Institut de Recherche d'Informatique et d'Automatique <Rocquencourt></subfield><subfield code="v">33</subfield><subfield code="w">(DE-604)BV008910398</subfield><subfield code="9">33</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005990660</subfield></datafield></record></collection> |
| id | DE-604.BV009050898 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-02T09:06:41Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005990660 |
| oclc_num | 634635087 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 9 S. |
| publishDate | 1973 |
| publishDateSearch | 1973 |
| publishDateSort | 1973 |
| publisher | IRIA |
| record_format | marc |
| series2 | Institut de Recherche d'Informatique et d'Automatique <Rocquencourt> / Laboratoire de Recherche: Rapport de recherche |
| spelling | Hyafil, Laurent Verfasser aut Graph partitioning and constructing optimal decision trees are polynomial complete problems Laurent Hyafil ; R. L. Rivest* Rocquencourt IRIA 1973 9 S. txt rdacontent n rdamedia nc rdacarrier Institut de Recherche d'Informatique et d'Automatique <Rocquencourt> / Laboratoire de Recherche: Rapport de recherche 33 Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s DE-604 Rivest, R. L. Verfasser aut Laboratoire de Recherche: Rapport de recherche Institut de Recherche d'Informatique et d'Automatique <Rocquencourt> 33 (DE-604)BV008910398 33 |
| spellingShingle | Hyafil, Laurent Rivest, R. L. Graph partitioning and constructing optimal decision trees are polynomial complete problems Graphentheorie (DE-588)4113782-6 gnd |
| subject_GND | (DE-588)4113782-6 |
| title | Graph partitioning and constructing optimal decision trees are polynomial complete problems |
| title_auth | Graph partitioning and constructing optimal decision trees are polynomial complete problems |
| title_exact_search | Graph partitioning and constructing optimal decision trees are polynomial complete problems |
| title_full | Graph partitioning and constructing optimal decision trees are polynomial complete problems Laurent Hyafil ; R. L. Rivest* |
| title_fullStr | Graph partitioning and constructing optimal decision trees are polynomial complete problems Laurent Hyafil ; R. L. Rivest* |
| title_full_unstemmed | Graph partitioning and constructing optimal decision trees are polynomial complete problems Laurent Hyafil ; R. L. Rivest* |
| title_short | Graph partitioning and constructing optimal decision trees are polynomial complete problems |
| title_sort | graph partitioning and constructing optimal decision trees are polynomial complete problems |
| topic | Graphentheorie (DE-588)4113782-6 gnd |
| topic_facet | Graphentheorie |
| volume_link | (DE-604)BV008910398 |
| work_keys_str_mv | AT hyafillaurent graphpartitioningandconstructingoptimaldecisiontreesarepolynomialcompleteproblems AT rivestrl graphpartitioningandconstructingoptimaldecisiontreesarepolynomialcompleteproblems |