Author:
Bulatov Andrei A.,Dalmau Víctor,Grohe Martin,Marx Dániel
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference26 articles.
1. Albert Atserias, Martin Grohe, Dániel Marx, Size bounds and query plans for relational joins, in: 49th Annual IEEE Symposium on Foundations of Computer Science (FOCSʼ08), 2008, pp. 739–748.
2. Towards sharp inapproximability for any 2-CSP;Austrin;SIAM J. Comput.,2010
3. Graphs, polymorphisms and the complexity of homomorphism problems;Barto;SIAM J. Comput.,2009
4. The complexity of temporal constraint satisfaction problems;Bodirsky;J. ACM,2010
5. A tourist guide through treewidth;Bodlaender;Acta Cybernet.,1993
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献