Tractability : (Record no. 37039)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 02065nam a22002897a 4500 |
001 - CONTROL NUMBER | |
control field | sulb-eb0015195 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | BD-SySUS |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20160405134116.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 111101s2014||||enk o ||1 0|eng|d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
International Standard Book Number | 9781139177801 (ebook) |
Canceled/invalid ISBN | 9781107025196 (hardback) |
040 ## - CATALOGING SOURCE | |
Original cataloging agency | UkCbUP |
Language of cataloging | eng |
Description conventions | rda |
Transcribing agency | UkCbUP |
Modifying agency | BD-SySUS. |
050 00 - LIBRARY OF CONGRESS CALL NUMBER | |
Classification number | QA76.9.A43 |
Item number | .T733 2014 |
245 00 - TITLE STATEMENT | |
Title | Tractability : |
Remainder of title | Practical Approaches to Hard Problems / |
Statement of responsibility, etc. | edited by Lucas Bordeaux, Youssef Hamadi, Pushmeet Kohli. |
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
Place of production, publication, distribution, manufacture | Cambridge : |
Name of producer, publisher, distributor, manufacturer | Cambridge University Press, |
Date of production, publication, distribution, manufacture, or copyright notice | 2014. |
300 ## - PHYSICAL DESCRIPTION | |
Extent | 1 online resource (396 pages) : |
Other physical details | digital, PDF file(s). |
500 ## - GENERAL NOTE | |
General note | Title from publisher's bibliographic system (viewed on 04 Apr 2016). |
520 ## - SUMMARY, ETC. | |
Summary, etc. | 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. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Computer algorithms |
Topical term or geographic name as entry element | Computational complexity |
700 1# - ADDED ENTRY--PERSONAL NAME | |
Personal name | Bordeaux, Lucas, |
Relator term | editor. |
Personal name | Hamadi, Youssef, |
Relator term | editor. |
Personal name | Kohli, Pushmeet, |
Relator term | editor. |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
Relationship information | Print version: |
International Standard Book Number | 9781107025196 |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | <a href="http://dx.doi.org/10.1017/CBO9781139177801">http://dx.doi.org/10.1017/CBO9781139177801</a> |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Source of classification or shelving scheme | |
Koha item type |
No items available.