Tractability

Practical Approaches to Hard Problems

Nonfiction, Science & Nature, Mathematics, Computers, General Computing, Programming
Cover of the book Tractability by , Cambridge University Press
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: ISBN: 9781107720558
Publisher: Cambridge University Press Publication: February 6, 2014
Imprint: Cambridge University Press Language: English
Author:
ISBN: 9781107720558
Publisher: Cambridge University Press
Publication: February 6, 2014
Imprint: Cambridge University Press
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Cambridge University Press

Cover of the book The Cambridge Double Star Atlas by
Cover of the book Industrial Organization by
Cover of the book Chronic Care Nursing by
Cover of the book An Introduction to the Theory of Knowledge by
Cover of the book The Role of International Law in Rebuilding Societies after Conflict by
Cover of the book Why Mugabe Won by
Cover of the book Fetal Therapy by
Cover of the book Language Contact by
Cover of the book The PCR Revolution by
Cover of the book Modern Treaty Law and Practice by
Cover of the book The Cambridge History of Ireland: Volume 2, 1550–1730 by
Cover of the book Mabberley's Plant-book by
Cover of the book Fabrication of Empire by
Cover of the book Beyond Smoke and Mirrors by
Cover of the book Consanguinity in Context by
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy