Bordeaux, Lucas editor of compilation. Hamadi, Youssef editor of compilation. Kohli, Pushmeet editor of compilation. text enk 2014 monographic eng

electronic

1 online resource (396 pages) : digital, PDF file(s). 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. Edited by Lucas Bordeaux, Youssef Hamadi, Pushmeet Kohli. Title from publisher's bibliographic system (viewed on 09 Oct 2015). Computer algorithms Computational complexity QA76.9.A43 .T733 2014 n/a 9781139177801 (ebook) http://dx.doi.org/10.1017/CBO9781139177801 http://dx.doi.org/10.1017/CBO9781139177801 UkCbUP 111101 20171019154622.0 CR9781139177801