Tractability

Tractability
Pris
1 229,-
E-Bok
E-bøkene legges i din ARK-leseapp. Bøkene kan også lastes ned fra Din side.
×
Logg deg inn for å gjennomføre dette kjøpet med ett klikk!

Etter at kjøpet er gjennomført vil boken være tilgjengelig på «din side» og i ARK-appen
Format E-Bok
Filformat PDF
Utgivelsesår 2014
Forlag Cambridge University Press
Språk Engelsk
ISBN 9781139894418
Emne Algorithms & data structures; Computer science

Om Tractability

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.


Kundevurderinger

ARKs anbefalinger

Det finnes ingen vurderinger av dette produktet. Skriv anmeldelse

Mer fra Dipali Mukhopadhyay

Se hele listen

Anbefalt


Tips en venn