Product Type
Condition
Binding
Collectible Attributes
Free Shipping
Seller Location
Seller Rating
Published by Cambridge University Press, Cambridge, UK, 2014
ISBN 10: 1107025192ISBN 13: 9781107025196
Seller: Florida Mountain Book Co., Datil, NM, U.S.A.
Book
Condition: 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.
Published by Cambridge University Press, 2014
ISBN 10: 1107025192ISBN 13: 9781107025196
Seller: Labyrinth Books, Princeton, NJ, U.S.A.
Book
Condition: Very Good.
Published by Cambridge University Press, 2014
ISBN 10: 1107025192ISBN 13: 9781107025196
Seller: GF Books, Inc., Hawthorne, CA, U.S.A.
Book
Condition: Fine. Book is in Used-LikeNew condition. Pages and cover are clean and intact. Used items may not include supplementary materials such as CDs or access codes. May show signs of minor shelf wear.
Published by Cambridge University Press, 2014
ISBN 10: 1107025192ISBN 13: 9781107025196
Seller: GF Books, Inc., Hawthorne, CA, U.S.A.
Book
Condition: Very Good. Book is in Used-VeryGood condition. Pages and cover are clean and intact. Used items may not include supplementary materials such as CDs or access codes. May show signs of minor shelf wear and contain very limited notes and highlighting.
Published by Cambridge University Press, 2014
ISBN 10: 1107025192ISBN 13: 9781107025196
Seller: GoldenWavesOfBooks, Fayetteville, TX, U.S.A.
Book
Hardcover. Condition: new. New. Fast Shipping and good customer service.
Published by Cambridge University Press, 2014
ISBN 10: 1107025192ISBN 13: 9781107025196
Seller: Books Unplugged, Amherst, NY, U.S.A.
Book
Condition: New. Buy with confidence! Book is in new, never-used condition.
Published by Cambridge University Press, 2014
ISBN 10: 1107025192ISBN 13: 9781107025196
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Book
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Published by Cambridge University Press 2014-02-06, Cambridge, 2014
ISBN 10: 1107025192ISBN 13: 9781107025196
Seller: Blackwell's, London, United Kingdom
Book
hardback. Condition: New. Language: ENG.
Published by Cambridge University Press, 2014
ISBN 10: 1107025192ISBN 13: 9781107025196
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Book
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Published by Cambridge Univ Pr, 2014
ISBN 10: 1107025192ISBN 13: 9781107025196
Seller: Revaluation Books, Exeter, United Kingdom
Book
Hardcover. Condition: Brand New. 377 pages. 10.00x7.00x1.00 inches. In Stock.
Published by Cambridge University Press, 2014
ISBN 10: 1107025192ISBN 13: 9781107025196
Seller: Mispah books, Redhill, SURRE, United Kingdom
Book
Hardcover. Condition: Like New. Like New. book.
Published by Cambridge University Press, Cambridge, 2014
ISBN 10: 1107025192ISBN 13: 9781107025196
Seller: AussieBookSeller, Truganina, VIC, Australia
Book
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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Published by Cambridge University Press, 2014
ISBN 10: 1107025192ISBN 13: 9781107025196
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Book
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. . . . . Books ship from the US and Ireland.
Published by Cambridge University Press, 2014
ISBN 10: 1107025192ISBN 13: 9781107025196
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Book First Edition
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. . . . .
Published by CAMBRIDGE, 2014
ISBN 10: 1107025192ISBN 13: 9781107025196
Seller: Iridium_Books, DH, SE, Spain
Book
Condition: Muy Bueno / Very Good.