You might also like

Availability alert

More about Tractability

• Book details
• Synopsis
• Trending among others

You get 441 loyalty points

Book synopsis

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 are 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.

Book details

Book category Books in English Computing & information technology Computer science

• Full title: Tractability
• Author: Lucas BordeauxYoussef HamadiPushmeet KohliRobert Mateescu
• Language: English
• Binding: Hardback
• Number of pages: 396
• EAN: 9781107025196
• ISBN: 1107025192
• ID: 02050765
• Publisher: Cambridge University Press
• Weight: 932 g
• Dimensions: 248 × 179 × 23 mm
• Date of publishing: 06. February 2014

Trending among others

---

---

---