Tractability
Classical computer science textbooks tell us that some problems are 'hard'. Yet many areas, from machine learning and computer vision to theorem proving and software verification, have defined their own set of tools for effectively solving complex problems. Tractability provides an overvie...
Gespeichert in:
| Weitere Verfasser: | , , |
|---|---|
| Format: | E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2014
|
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9781139177801 | ||
| 003 | UkCbUP | ||
| 005 | 20151005020622.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 111101s2014||||enk o ||1 0|eng|d | ||
| 020 | |a 9781139177801 | ||
| 245 | 0 | 0 | |a Tractability |c edited by Lucas Bordeaux (Microsoft Research), Youssef Hamadi (Microsoft Research), Pushmeet Kohli (Microsoft Research) |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2014 | |
| 300 | |a 1 Online-Ressource (xxi, 377 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 520 | |a Classical computer science textbooks tell us that some problems are 'hard'. Yet many areas, from machine learning and computer vision to theorem proving and software verification, have defined their own set of tools for effectively solving complex problems. Tractability provides an overview of these different techniques, and of the fundamental concepts and properties used to tame intractability. This book will help you understand what to do when facing a hard computational problem. Can the problem be modelled by convex, or submodular functions? Will the instances arising in practice be of low treewidth, or exhibit another specific graph structure that makes them easy? Is it acceptable to use scalable, but approximate algorithms? A wide range of approaches is presented through self-contained chapters written by authoritative researchers on each topic. As a reference on a core problem in computer science, this book will appeal to theoreticians and practitioners alike. | ||
| 700 | 1 | |a Bordeaux, Lucas | |
| 700 | 1 | |a Hamadi, Youssef | |
| 700 | 1 | |a Kohli, Pushmeet | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781107025196 |
| 856 | 4 | 0 | |l TUM01 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9781139177801 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9781139177801 |
|---|---|
| _version_ | 1818779685909168128 |
| adam_text | |
| any_adam_object | |
| author2 | Bordeaux, Lucas Hamadi, Youssef Kohli, Pushmeet |
| author2_role | |
| author2_variant | l b lb y h yh p k pk |
| author_facet | Bordeaux, Lucas Hamadi, Youssef Kohli, Pushmeet |
| author_sort | Bordeaux, Lucas |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| doi_str_mv | 10.1017/CBO9781139177801 |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01805nam a2200265 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9781139177801</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20151005020622.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">111101s2014||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139177801</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Tractability</subfield><subfield code="c">edited by Lucas Bordeaux (Microsoft Research), Youssef Hamadi (Microsoft Research), Pushmeet Kohli (Microsoft Research)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xxi, 377 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Classical computer science textbooks tell us that some problems are 'hard'. Yet many areas, from machine learning and computer vision to theorem proving and software verification, have defined their own set of tools for effectively solving complex problems. Tractability provides an overview of these different techniques, and of the fundamental concepts and properties used to tame intractability. This book will help you understand what to do when facing a hard computational problem. Can the problem be modelled by convex, or submodular functions? Will the instances arising in practice be of low treewidth, or exhibit another specific graph structure that makes them easy? Is it acceptable to use scalable, but approximate algorithms? A wide range of approaches is presented through self-contained chapters written by authoritative researchers on each topic. As a reference on a core problem in computer science, this book will appeal to theoreticians and practitioners alike.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bordeaux, Lucas</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hamadi, Youssef</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kohli, Pushmeet</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781107025196</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">TUM01</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/CBO9781139177801</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9781139177801 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-18T12:04:33Z |
| institution | BVB |
| isbn | 9781139177801 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xxi, 377 Seiten) |
| psigel | ZDB-20-CTM |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Tractability edited by Lucas Bordeaux (Microsoft Research), Youssef Hamadi (Microsoft Research), Pushmeet Kohli (Microsoft Research) Cambridge Cambridge University Press 2014 1 Online-Ressource (xxi, 377 Seiten) txt c cr Classical computer science textbooks tell us that some problems are 'hard'. Yet many areas, from machine learning and computer vision to theorem proving and software verification, have defined their own set of tools for effectively solving complex problems. Tractability provides an overview of these different techniques, and of the fundamental concepts and properties used to tame intractability. This book will help you understand what to do when facing a hard computational problem. Can the problem be modelled by convex, or submodular functions? Will the instances arising in practice be of low treewidth, or exhibit another specific graph structure that makes them easy? Is it acceptable to use scalable, but approximate algorithms? A wide range of approaches is presented through self-contained chapters written by authoritative researchers on each topic. As a reference on a core problem in computer science, this book will appeal to theoreticians and practitioners alike. Bordeaux, Lucas Hamadi, Youssef Kohli, Pushmeet Erscheint auch als Druck-Ausgabe 9781107025196 TUM01 ZDB-20-CTM TUM_PDA_CTM https://doi.org/10.1017/CBO9781139177801 Volltext |
| spellingShingle | Tractability |
| title | Tractability |
| title_auth | Tractability |
| title_exact_search | Tractability |
| title_full | Tractability edited by Lucas Bordeaux (Microsoft Research), Youssef Hamadi (Microsoft Research), Pushmeet Kohli (Microsoft Research) |
| title_fullStr | Tractability edited by Lucas Bordeaux (Microsoft Research), Youssef Hamadi (Microsoft Research), Pushmeet Kohli (Microsoft Research) |
| title_full_unstemmed | Tractability edited by Lucas Bordeaux (Microsoft Research), Youssef Hamadi (Microsoft Research), Pushmeet Kohli (Microsoft Research) |
| title_short | Tractability |
| title_sort | tractability |
| url | https://doi.org/10.1017/CBO9781139177801 |
| work_keys_str_mv | AT bordeauxlucas tractability AT hamadiyoussef tractability AT kohlipushmeet tractability |