000 02250nam a22003498a 4500
001 CR9781139177801
003 UkCbUP
005 20171019123614.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 111101s2014||||enk s ||1 0|eng|d
020 _a9781139177801 (ebook)
020 _z9781107025196 (hardback)
040 _aUkCbUP
_cUkCbUP
_erda
050 0 0 _aQA76.9.A43
_b.T733 2014
082 0 0 _an/a
_2n/a
245 0 0 _aTractability :
_bPractical Approaches to Hard Problems /
_cEdited by Lucas Bordeaux, Youssef Hamadi, Pushmeet Kohli.
264 1 _aCambridge :
_bCambridge University Press,
_c2014.
300 _a1 online resource (396 pages) :
_bdigital, PDF file(s).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
500 _aTitle from publisher's bibliographic system (viewed on 09 Oct 2015).
520 _aClassical 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.
650 0 _aComputer algorithms
650 0 _aComputational complexity
700 1 _aBordeaux, Lucas,
_eeditor of compilation.
700 1 _aHamadi, Youssef,
_eeditor of compilation.
700 1 _aKohli, Pushmeet,
_eeditor of compilation.
776 0 8 _iPrint version:
_z9781107025196
856 4 0 _uhttp://dx.doi.org/10.1017/CBO9781139177801
999 _c225751
_d225751