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 America's Dirty Wars by
Cover of the book The Economic and Social History of Brazil since 1889 by
Cover of the book Beyond Smoke and Mirrors by
Cover of the book Pamela in Her Exalted Condition by
Cover of the book The Cambridge History of Communism: Volume 3, Endgames? Late Communism in Global Perspective, 1968 to the Present by
Cover of the book From Matter to Life by
Cover of the book An Introduction to Nuclear Physics by
Cover of the book White Space Communication Technologies by
Cover of the book Radiogenic Isotope Geochemistry by
Cover of the book Machiavelli: The Prince by
Cover of the book Reasonableness and Fairness by
Cover of the book Fundamentals of Multiphase Flow by
Cover of the book No Exit from Pakistan by
Cover of the book Christianity and Natural Law by
Cover of the book The Cambridge Companion to Popper 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