Tractability : practical approaches to hard problems / edited by Lucas Bordeaux, Youssef Hamadi, and Pushmeet Kohli.
An overview of the techniques developed to circumvent computational intractability, a key challenge in many areas of computer science.
Saved in:
Online Access: |
Full Text (via ProQuest) |
---|---|
Other Authors: | , , |
Format: | eBook |
Language: | English |
Published: |
Cambridge :
Cambridge University Press,
2014.
|
Subjects: |
MARC
LEADER | 00000cam a2200000 i 4500 | ||
---|---|---|---|
001 | b10189489 | ||
006 | m o d | ||
007 | cr ||||||||||| | ||
008 | 140201s2014 enka ob 000 0 eng d | ||
005 | 20240507225502.6 | ||
016 | 7 | |a 016628827 |2 Uk | |
019 | |a 870720143 |a 874223186 |a 880917388 |a 1167574749 | ||
020 | |a 9781139177801 |q (electronic bk.) | ||
020 | |a 113917780X |q (electronic bk.) | ||
020 | |a 9781107731851 |q (electronic bk.) | ||
020 | |a 1107731852 |q (electronic bk.) | ||
020 | |z 1107025192 | ||
020 | |z 9781107025196 | ||
020 | |z 9781107723726 | ||
020 | |z 1107723728 | ||
029 | 1 | |a AU@ |b 000052923241 | |
029 | 1 | |a CHNEW |b 000886652 | |
029 | 1 | |a DEBBG |b BV043606939 | |
029 | 1 | |a DEBSZ |b 40524391X | |
029 | 1 | |a NLGGC |b 391934643 | |
029 | 1 | |a NZ1 |b 15495967 | |
035 | |a (OCoLC)ebq869640202dda | ||
035 | |a (OCoLC)869640202 |z (OCoLC)870720143 |z (OCoLC)874223186 |z (OCoLC)880917388 |z (OCoLC)1167574749 | ||
037 | |a ebq1578903dda | ||
040 | |a EBLCP |b eng |e rda |e pn |c EBLCP |d OCLCQ |d UKMGB |d N$T |d CAMBR |d YDXCP |d DEBSZ |d OCLCQ |d OCLCO |d B24X7 |d COO |d CAMBR |d OCLCF |d AU@ |d OCLCQ |d UIU |d LIV |d OCLCQ |d UKAHL |d OL$ |d OCLCQ |d BRF |d LUN |d SFB |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d S9M |d OCLCL |d OCLCQ | ||
049 | |a GWRE | ||
050 | 4 | |a QA267.7 |b T73 2014ab | |
245 | 0 | 0 | |a Tractability : |b practical approaches to hard problems / |c edited by Lucas Bordeaux, Youssef Hamadi, and Pushmeet Kohli. |
264 | 1 | |a Cambridge : |b Cambridge University Press, |c 2014. | |
300 | |a 1 online resource (xxii, 377 pages) : |b illustrations | ||
336 | |a text |b txt |2 rdacontent | ||
337 | |a computer |b c |2 rdamedia | ||
338 | |a volume |b nc |2 rdacarrier | ||
504 | |a Includes bibliographical references. | ||
588 | 0 | |a Print version record. | |
520 | |a An overview of the techniques developed to circumvent computational intractability, a key challenge in many areas of computer science. | ||
505 | 0 | |a Cover -- Tractability -- Title Page -- Copyright Page -- Contents -- Contributors -- Introduction -- Part 1: Graphical Structure -- 1 Treewidth and Hypertree Width -- 1.1 Treewidth -- 1.2 Hypertree width -- 1.3 Applications of hypertree width -- 1.4 Beyond (hyper)tree decompositions -- 1.5 Tractability frontiers (for CSPs) -- 1.6 Conclusion -- References -- 2 Perfect Graphs and Graphical Modeling -- 2.1 Berge Graphs and Perfect Graphs -- 2.2 Computational Properties of Perfect Graphs -- 2.3 Graphical Models -- 2.4 Nand Markov Random Fields | |
505 | 8 | |a 2.5 Maximum Weight Stable Set2.6 Tractable Graphical Models -- 2.7 Discussion -- 2.8 Acknowledgments -- 2.9 Appendix -- References -- Part 2: Language Restrictions -- 3 Submodular Function Maximization -- 3.1 Submodular Functions -- 3.2 Greedy Maximization of Submodular Functions -- 3.3 Beyond the Greedy Algorithm: Handling More Complex Constraints -- 3.4 Online Maximization of Submodular Functions -- 3.5 Adaptive Submodularity -- 3.6 Conclusions -- References -- 4 Tractable Valued Constraints -- 4.1 Introduction -- 4.2 Constraint Satisfaction Problems | |
505 | 8 | |a 4.3 Valued Constraint Satisfaction Problems4.4 Examples of Valued Constraint Languages -- 4.5 Expressive Power -- 4.6 Submodular Functions and Multimorphisms -- 4.7 Conservative Valued Constraint Languages -- 4.8 A General Algebraic Theory of Complexity -- 4.9 Conclusions and Open Problems -- References -- 5 Tractable Knowledge Representation Formalisms -- 5.1 Introduction -- 5.2 A Motivating Example -- 5.3 Negation Normal Form -- 5.4 Structured Decomposability -- 5.5 (X, Y)-Decompositions of Boolean Functions -- 5.6 Sentential Decision Diagrams | |
505 | 8 | |a 5.7 The Process of Compilation5.8 Knowledge Compilation in Probabilistic Reasoning -- 5.9 Conclusion -- References -- Part 3: Algorithms and their Analysis -- 6 Tree-Reweighted Message Passing -- 6.1 Introduction -- 6.2 Preliminaries -- 6.3 Sequential Tree-Reweighted Message Passing (TRW-S) -- 6.4 Analysis of the Algorithm -- 6.5 TRW-S with Monotonic Chains -- 6.6 Summary of the TRW-S Algorithm -- 6.7 Related Approaches -- 6.8 Conclusions and Discussion -- References -- 7 Tractable Optimization in Machine Learning -- 7.1 Introduction -- 7.2 Background | |
505 | 8 | |a 7.3 Smooth Convex Optimization7.4 Nonsmooth Convex Optimization -- 7.5 Stochastic Optimization -- 7.6 Summary -- References -- 8 Approximation Algorithms -- 8.1 Introduction -- 8.2 Combinatorial Algorithms -- 8.3 Linear Programming Based Algorithms -- 8.4 Semi-Definite Programming Based Algorithms -- 8.5 Algorithms for Special Instances -- 8.6 Metric Embeddings -- 8.7 Hardness of Approximation -- References -- 9 Kernelization Methods for Fixed-Parameter Tractability -- 9.1 Introduction -- 9.2 Basic Definitions -- 9.3 Classical Techniques | |
650 | 0 | |a Computational complexity. | |
650 | 0 | |a Parameter estimation. | |
650 | 7 | |a Computational complexity |2 fast | |
650 | 7 | |a Parameter estimation |2 fast | |
700 | 1 | |a Bordeaux, Lucas, |e editor. | |
700 | 1 | |a Hamadi, Youssef |c (Computer science researcher), |e editor. |1 https://id.oclc.org/worldcat/entity/E39PCjqmtH8cJbXDW44VPFJpbm | |
700 | 1 | |a Kohli, Pushmeet, |e editor. | |
758 | |i has work: |a Tractability (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGd99wQYPrYtrfb4GRBWwC |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
776 | 0 | 8 | |i Print version: |a Bordeaux, Lucas. |t Tractability : Practical Approaches to Hard Problems. |d Cambridge : Cambridge University Press, ©2014 |z 9781107025196 |
856 | 4 | 0 | |u https://ebookcentral.proquest.com/lib/ucb/detail.action?docID=1578903 |z Full Text (via ProQuest) |
915 | |a - | ||
936 | |a BATCHLOAD | ||
956 | |a Ebook Central DDA | ||
956 | |b Ebook Central DDA Titles | ||
994 | |a 92 |b COD | ||
998 | |b WorldCat record encoding level change | ||
999 | f | f | |i cb0b61ef-041d-5513-a41b-0996398015ae |s e5ec599f-6318-5e23-be50-617534eb8e21 |
952 | f | f | |p Can circulate |a University of Colorado Boulder |b Online |c Online |d Online |e QA267.7 T73 2014ab |h Library of Congress classification |i web |n 1 |