Tractable structures for constraint satisfaction with truth tables

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 3, Issue , 2009, Pages 649-660

  Marx, Dániel ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Adaptive width; Computational complexity; Constraint satisfaction; Treewidth

Indexed keywords

ADAPTIVE WIDTH; CONSTRAINT SATISFACTION; GRAPH STRUCTURES; HYPER GRAPH; POLYNOMIAL-TIME; SOLVABLE CASE; TREE-WIDTH; TRUTH TABLES;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 77954701166     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. I. Adler. Width functions for hypertree decompositions. PhD thesis, 2006.
2. H. Chen and M. Grohe. Constraint satisfaction problems with succinctly specified relations, 2006.
3. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
4. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, Berlin, 2006.
5. E. C. Freuder. Complexity of k-tree structured constraint satisfaction problems. In Proc. of AAAI-90, 4-9, Boston, MA, 1990.
6. G. Gottlob, F. Scarcello, and M. Sideri. Fixed-parameter complexity in AI and nonmonotonic reasoning. Artificial Intelligence, 138(1-2):55-86, 2002.
7. M. Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM, 54(1):1, 2007.
8. M. Grohe and D. Marx. Constraint solving via fractional edge covers. In SODA '06, 289-298, 2006.
9. R. Impagliazzo, R. Paturi, and F. Zane. Which problems have strongly exponential complexity? J. Comput. System Sci., 63(4):512-530, 2001.
10. D. Marx. Approximating fractional hypertree width. In SODA '09, 902-911, 2009.
11. D. Marx. Can you beat treewidth? In FOCS '07, 169-179, 2007.