Date: 2015-11-09 10:22:02Theoretical computer science Computational complexity theory Mathematics Constraint programming NP-complete problems Boolean algebra Parameterized complexity Boolean satisfiability problem Constraint satisfaction problem Exponential time hypothesis Treewidth Tree decomposition | | Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1Add to Reading ListSource URL: drops.dagstuhl.deDownload Document from Source Website File Size: 514,75 KBShare Document on Facebook
|