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 CMOS and Beyond by
Cover of the book Politicising Europe by
Cover of the book Collision Phenomena in Liquids and Solids by
Cover of the book The Cambridge Companion to Theodore Dreiser by
Cover of the book Markov Chains and Dependability Theory by
Cover of the book Intellectuals and the Search for National Identity in Twentieth-Century Brazil by
Cover of the book Case by
Cover of the book The Correspondence of Charles Darwin: Volume 25, 1877 by
Cover of the book Text and Authority in the South African Nazaretha Church by
Cover of the book Clarity of Responsibility, Accountability, and Corruption by
Cover of the book Neonatal Hematology by
Cover of the book Cooperating for Peace and Security by
Cover of the book PowerPoint, Communication, and the Knowledge Society by
Cover of the book Substance and Behavioral Addictions by
Cover of the book Climate Change 2013 – The Physical Science Basis 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