Idioma: Inglés
Publicado por Cambridge University Press, Cambridge, UK, 2014
ISBN 10: 1107025192 ISBN 13: 9781107025196
Librería: Florida Mountain Book Co., Datil, NM, Estados Unidos de America
EUR 31,65
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Good+. Hardcover, [xxi], 377 pages. Good+ condition. Size 10"x7". "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." Book has moderate shelfwear, boards are bumped on extremities. Interior text is Near Fine, clean and unmarked.
Idioma: Inglés
Publicado por Cambridge University Press, 2014
ISBN 10: 1107025192 ISBN 13: 9781107025196
Librería: Labyrinth Books, Princeton, NJ, Estados Unidos de America
EUR 51,52
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: Very Good.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 263,25
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Brand New. 377 pages. 10.00x7.00x1.00 inches. In Stock.