Technical Perspective Constraint Satisfaction Problems and Computational Complexity

被引:0
|
作者
Jerrum, Mark [1 ]
机构
[1] Univ London, London WC1E 7HU, England
关键词
D O I
10.1145/1810891.1810913
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:98 / 98
页数:1
相关论文
共 50 条
  • [1] On the Computational Complexity of Monotone Constraint Satisfaction Problems
    Hermann, Miki
    Richoux, Florian
    WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5431 : 286 - 297
  • [2] Computational complexity of constraint satisfaction
    Vollmer, Heribert
    COMPUTATION AND LOGIC IN THE REAL WORLD, PROCEEDINGS, 2007, 4497 : 748 - 757
  • [3] The Complexity of Constraint Satisfaction Problems
    Bodirsky, Manuel
    32ND INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2015), 2015, 30 : 2 - 9
  • [4] Spines of random constraint satisfaction problems: definition and connection with computational complexity
    Istrate, G
    Boettcher, S
    Percus, AG
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2005, 44 (04) : 353 - 372
  • [5] Spines of random constraint satisfaction problems: definition and connection with computational complexity
    Gabriel Istrate
    Stefan Boettcher
    Allon G. Percus
    Annals of Mathematics and Artificial Intelligence, 2005, 44 : 353 - 372
  • [6] Parameterized complexity of constraint satisfaction problems
    Dániel Marx
    computational complexity, 2005, 14 : 153 - 183
  • [7] Complexity of Conservative Constraint Satisfaction Problems
    Bulatov, Andrei A.
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2011, 12 (04)
  • [8] Constraint Satisfaction Problems: Complexity and Algorithms
    Bulatov, Andrei A.
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2018), 2018, 10792 : 1 - 25
  • [9] The Complexity of Temporal Constraint Satisfaction Problems
    Bodirsky, Manuel
    Kara, Jan
    JOURNAL OF THE ACM, 2010, 57 (02)
  • [10] The Complexity of Temporal Constraint Satisfaction Problems
    Bodirsky, Manuel
    Kara, Jan
    STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, : 29 - 38