Treewidth and the computational complexity of MAP Approximations

被引：0
|
作者：
机构：
[1] Kwisthout, Johan
来源：
Kwisthout, Johan (j.kwisthout@donders.ru.nl) | 1600年 / Springer Verlag卷 / 8754期
关键词：
D O I：
10.1007/978-3-319-11433-0_18
中图分类号：
O144 [集合论]; O157 [组合数学（组合学）];
学科分类号：
070104 ;
摘要：
引用
收藏
相关论文
共 50 条
  • [41] From Query Complexity to Computational Complexity
    Dobzinski, Shahar
    Vondrak, Jan
    STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 1107 - 1116
  • [42] Natural complexity, computational complexity and depth
    Machta, J.
    CHAOS, 2011, 21 (03)
  • [43] Targeted Negative Campaigning: Complexity and Approximations
    Zagoury, Avishai
    Keller, Orgad
    Hassidim, Avinatan
    Hazon, Noam
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 5768 - 5778
  • [44] Radiocoloring in planar graphs: Complexity and approximations
    Fotakis, DA
    Nikoletseas, SE
    Papadopoulou, VG
    Spirakis, PG
    THEORETICAL COMPUTER SCIENCE, 2005, 340 (03) : 514 - 538
  • [45] Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Computational Complexity and Efficient Approximations
    Yang, Dejun
    Misra, Satyajayant
    Fang, Xi
    Xue, Guoliang
    Zhang, Junshan
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2012, 11 (08) : 1399 - 1411
  • [46] The computational complexity of QoS measures for orchestrationsThe computational complexity of QoS measures
    Joaquim Gabarro
    Sergio Leon-Gaixas
    Maria Serna
    Journal of Combinatorial Optimization, 2017, 34 : 1265 - 1301
  • [47] Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard
    Fandinno, Jorge
    Hecher, Markus
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 6312 - 6320
  • [48] Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover (Extended Abstract)
    Fiala, Jiri
    Golovach, Petr A.
    Kratochvil, Jan
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 221 - +
  • [49] Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds
    Focke, Jacob
    Marx, Daniel
    Rzazewski, Pawel
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 431 - 458
  • [50] GENERALIZED COMPUTATIONAL COMPLEXITY
    JACOBS, BE
    JOURNAL OF SYMBOLIC LOGIC, 1977, 42 (01) : 47 - 58
12345