Exploiting Structure in CSP-related Problems
作者： Tommy Färnqvist
DOI:
关键词:
摘要: In this thesis we investigate the computational complexity and approximability of problems from constraint satisfaction framework. An instance a problem ...
参考文章(198)
Jörg Flum, Martin Grohe, Parameterized complexity theory Springer. ,(2010)
Vanja Josifovski, Design, implementation and evaluation of a distributed mediator system for data integration Linköpings universitet. ,(1999)
Ulf Nilsson, Abstract interpretations and abstract machines : contributions to a methodology for the implementation of logic programs Linköping University Electronic Press. ,(1992)
A. Frieze, M. Jerrum, Improved approximation algorithms for MAX k-CUT and MAX BISECTION Algorithmica. ,vol. 18, pp. 67- 81 ,(1997) , 10.1007/BF02523688
Isaac L. Chuang, Michael A. Nielsen, Quantum Computation and Quantum Information ,(2000)
Tommy Färnqvist, Counting Homomorphisms via Hypergraph-Based Structural Restrictions Lecture Notes in Computer Science. pp. 380- 391 ,(2012) , 10.1007/978-3-642-32147-4_34
Tommy Färnqvist, Peter Jonsson, Bounded tree-width and CSP-related problems international symposium on algorithms and computation. pp. 632- 643 ,(2007) , 10.1007/978-3-540-77120-3_55
Leo G. Kroon, Arunabha Sen, Haiyong Deng, Asim Roy, The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs workshop on graph theoretic concepts in computer science. pp. 279- 292 ,(1996) , 10.1007/3-540-62559-3_23
Takayuki Yato, Takahiro Seta, Complexity and Completeness of Finding Another Solution and Its Application to Puzzles IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. ,vol. 86, pp. 1052- 1060 ,(2003)
Dan Roth, On the hardness of approximate reasoning Artificial Intelligence. ,vol. 82, pp. 273- 302 ,(1996) , 10.1016/0004-3702(94)00092-1