On Planar Boolean CSP-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On Planar Boolean CSP

Published:2015 Issue: Volume: Page:432-443
ISSN:0302-9743
Container-title:Automata, Languages, and Programming
language:
Short-container-title:

Author:

Dvořák Zdeněk,Kupec Martin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-47672-7_35

Reference16 articles.

1. Barto, L., Kozik, M.: Constraint satisfaction problems of bounded width. In: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 595–603. IEEE Computer Society, Washington, DC (2009)

2. Barto, L., Kozik, M., Niven, T.: The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell). SIAM Journal on Computing 38(5), 1782–1802 (2009)

3. Bulatov, A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the ACM (JACM) 53(1), 66–120 (2006)

4. Bulatov, A., Jeavons, P., Krokhin, A.: Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34(3), 720–742 (2005)

5. Cai, J.Y., Lu, P., Xia, M.: Holographic algorithms with matchgates capture precisely tractable planar #CSP. In: Proceedings of the 2010 51st Annual IEEE Symposium on Foundations of Computer Science, pp. 427–436. IEEE Computer Society, Washington, DC (2010)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Constraint Satisfaction Problems over Finite Structures;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29

2. Even Delta-Matroids and the Complexity of Planar Boolean CSPs;ACM Transactions on Algorithms;2019-04-30

3. On planar valued CSPs;Journal of Computer and System Sciences;2017-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3