"synopsis" may belong to another edition of this title.
"About this title" may belong to another edition of this title.
Shipping:
£ 3.17
Within U.S.A.
Book Description Hardcover. Condition: new. New. Fast Shipping and good customer service. Seller Inventory # Holz_New_1107025192
Book Description Condition: New. Well packaged and promptly shipped from California. Partnered with Friends of the Library since 2010. Seller Inventory # 1LAGBP001YLC
Book Description Condition: New. Buy with confidence! Book is in new, never-used condition. Seller Inventory # bk1107025192xvz189zvxnew
Book Description HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FM-9781107025196
Book Description hardback. Condition: New. Language: ENG. Seller Inventory # 9781107025196
Book Description Condition: new. Seller Inventory # 0186c477d572a8bf24b4df8d0b0cab09
Book Description HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FM-9781107025196
Book Description Hardcover. Condition: Brand New. 377 pages. 10.00x7.00x1.00 inches. In Stock. Seller Inventory # __1107025192
Book Description Hardcover. Condition: new. Hardcover. 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. Many computational problems cannot be solved efficiently according to classical computer science textbooks. Tractability gives a cross-disciplinary overview of the advanced techniques that have been developed in order to solve these 'hard' computational problems, and a unified presentation of the properties that can be exploited to make them tractable. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781107025196
Book Description Condition: New. An overview of the techniques developed to circumvent computational intractability, a key challenge in many areas of computer science. Editor(s): Bordeaux, Lucas; Hamadi, Youssef; Kohli, Pushmeet; Mateescu, Robert. Num Pages: 396 pages, 75 b/w illus. BIC Classification: UY. Category: (P) Professional & Vocational. Dimension: 248 x 179 x 23. Weight in Grams: 930. . 2014. 1st Edition. Hardcover. . . . . Seller Inventory # V9781107025196