Overview

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.
ISBN-13

9781107025196

ISBN-10

1107025192

Weight

2.05 Pounds

Dimensions

7.00 x 1.00 x 10.00 In

List Price

$160.00

Edition

1st Edition

Format

Hardcover

Language

English

Pages

396 pages

Publisher

Cambridge University Press

Published On

2014-02-06


View All Offers

Sort by:

Condition
Seller
Seller Comments
Price
✨ Used, Good
Seller details
Bonita
★★★★☆

Santa Clarita, CA, USA

Access codes and supplements are not guaranteed with used items. May be an ex-library book.
$110.54

 Free delivery by: 31 Mar 2026


Bookstores.com relies on cookies to improve your experience.