02266nam a22003378a 4500001001600000003000700016005001700023006001900040007001500059008004100074020002600115020002900141040002400170050002800194082001300222245014000235264005200375300005900427336002600486337002600512338003600538500007300574520098500647650002401632650002901656700004501685700004501730700004501775776003501820856007301855CR9781139177801UkCbUP20171019154622.0m|||||o||d||||||||cr||||||||||||111101s2014||||enk     s     ||1 0|eng|d  a9781139177801 (ebook)  z9781107025196 (hardback)  aUkCbUPcUkCbUPerda00aQA76.9.A43 b.T733 201400an/a2n/a00aTractability : Practical Approaches to Hard Problems / [electronic resource]cEdited by Lucas Bordeaux, Youssef Hamadi, Pushmeet Kohli. 1aCambridge :bCambridge University Press,c2014.  a1 online resource (396 pages) :bdigital, PDF file(s).  atextbtxt2rdacontent  acomputerbc2rdamedia  aonline resourcebcr2rdacarrier  aTitle from publisher's bibliographic system (viewed on 09 Oct 2015).  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. 0aComputer algorithms 0aComputational complexity1 aBordeaux, Lucas,eeditor of compilation.1 aHamadi, Youssef,eeditor of compilation.1 aKohli, Pushmeet,eeditor of compilation.08iPrint version: z978110702519640uhttp://dx.doi.org/10.1017/CBO9781139177801zCambridge Online Library