Mohlo by sa vám tiež páčiť

Viac informácií o knihe Tractability

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 321 bodov

Anotácia knihy

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 are 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.

Parametre knihy

Zaradenie knihy Knihy po anglicky Computing & information technology Computer science

• Celý názov: Tractability
• Autor: Lucas BordeauxYoussef HamadiPushmeet KohliRobert Mateescu
• Jazyk: Angličtina
• Väzba: Pevná
• Počet strán: 396
• EAN: 9781107025196
• ISBN: 1107025192
• ID: 02050765
• Nakladateľ: Cambridge University Press
• Hmotnosť: 932 g
• Rozmery: 248 × 179 × 23 mm
• Dátum vydania: 06. February 2014

Obľúbené z iného súdka

---

---

---