Parameterized complexity and subexponential-time computability

被引：5
|
作者：
机构：
[1] Chen, Jianer
[2] Kanj, Iyad A.
来源：
Chen, J. (chen@cs.tamu.edu) | 1600年 / Springer Verlag卷 / 7370期
关键词：
D O I：
10.1007/978-3-642-30891-8_11
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications
    Kanj, Iyad
    Szeider, Stefan
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2014), 2014, 8881 : 637 - 651
  • [2] Parameterized and subexponential-time complexity of satisfiability problems and applications
    Kanj, Iyad
    Szeider, Stefan
    THEORETICAL COMPUTER SCIENCE, 2015, 607 : 282 - 295
  • [3] On the Subexponential-Time Complexity of CSP
    de Haan, Ronald
    Kanj, Iyad
    Szeider, Stefan
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2015, 52 : 203 - 234
  • [4] EXPONENTIAL-TIME AND SUBEXPONENTIAL-TIME SETS
    TANG, SW
    FU, B
    LIU, T
    THEORETICAL COMPUTER SCIENCE, 1993, 115 (02) : 371 - 381
  • [5] Subexponential-Time Algorithms for Sparse PCA
    Ding, Yunzi
    Kunisky, Dmitriy
    Wein, Alexander S.
    Bandeira, Afonso S.
    FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2024, 24 (03) : 865 - 914
  • [6] An isomorphism between subexponential and parameterized complexity theory
    Chen, Yijia
    Grohe, Martin
    SIAM JOURNAL ON COMPUTING, 2007, 37 (04) : 1228 - 1258
  • [7] Exploring Subexponential Parameterized Complexity of Completion Problems
    Drange, Pal Gronas
    Fomin, Fedor, V
    Pilipczuk, Michal
    Villanger, Yngve
    31ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2014), 2014, 25 : 288 - 299
  • [8] An Isomorphism between Subexponential and Parameterized Complexity Theory
    Chen, Yijia
    Grohe, Martin
    CCC 2006: TWENTY-FIRST ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2006, : 314 - +
  • [9] Subexponential-Time Computation of Isolated Primary Components of a Polynomial Ideal
    Chistov A.L.
    Journal of Mathematical Sciences, 2021, 255 (2) : 143 - 148
  • [10] An exact subexponential-time lattice algorithm for Asian options
    Tian-Shyr Dai
    Yuh-Dauh Lyuu
    Acta Informatica, 2007, 44 : 23 - 39
12345