Tractability : practical approaches to hard problems /

An overview of the techniques developed to circumvent computational intractability, a key challenge in many areas of computer science.

Saved in:
Bibliographic Details
Other Authors: Bordeaux, Lucas (Editor), Hamadi, Youssef (Computer science researcher) (Editor), Kohli, Pushmeet (Editor)
Format: eBook
Language:English
Published: Cambridge : Cambridge University Press, 2014.
Subjects:
Online Access:CONNECT
CONNECT
LEADER 05625cam a2200637Mi 4500
001 mig00005339703
003 OCoLC
005 20210517053512.4
006 m o d
007 cr |n|||||||||
008 140201s2014 enka ob 000 0 eng d
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 
035 |a (OCoLC)869640202  |z (OCoLC)870720143  |z (OCoLC)874223186  |z (OCoLC)880917388  |z (OCoLC)1167574749 
035 0 0 |a ocm00000001wrldshrocn869640202 
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 
049 |a TXMM 
050 4 |a QA267.7  |b T73 2014ab 
082 0 4 |a 511.3  |2 23 
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 online resource  |b cr  |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 
590 |a EBSCO eBook Academic Comprehensive Collection North America 
650 0 |a Computational complexity. 
650 0 |a Parameter estimation. 
700 1 |a Bordeaux, Lucas,  |e editor. 
700 1 |a Hamadi, Youssef  |c (Computer science researcher),  |e editor. 
700 1 |a Kohli, Pushmeet,  |e editor. 
730 0 |a WORLDSHARE SUB RECORDS 
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://ezproxy.mtsu.edu/login?url=https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=685234  |z CONNECT  |3 EBSCO  |t 0 
907 |a 4610974  |b 05-26-21  |c 06-30-20 
998 |a wi  |b 05-26-21  |c m  |d z   |e -  |f eng  |g enk  |h 0  |i 2 
994 |a 92  |b TXM 
999 f f |i a8d60caf-fbbe-40e9-bb16-667c43dc190e  |s 046a0d63-b380-45cd-8cb0-f653b6f33b31  |t 0 
952 f f |t 1  |e QA267.7 T73 2014ab  |h Library of Congress classification 
856 4 0 |3 EBSCO  |t 0  |u https://ezproxy.mtsu.edu/login?url=https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=685234  |z CONNECT