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 条
  • [31] Computability, Complexity and Randomness
    Rod Downey
    Theory of Computing Systems, 2013, 52 : 1 - 1
  • [32] Computability and complexity in analysis
    Brattka, Vasco
    Ishihara, Hajime
    Schroeder, Matthias
    Zhong, Ning
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2008, 14 (06) : 800 - 800
  • [33] SUBEXPONENTIAL PARAMETERIZED ALGORITHM FOR MINIMUM FILL-IN
    Fomin, Fedor V.
    Villanger, Yngve
    SIAM JOURNAL ON COMPUTING, 2013, 42 (06) : 2197 - 2216
  • [34] Computability, Complexity and Randomness
    Downey, Rod
    THEORY OF COMPUTING SYSTEMS, 2013, 52 (01) : 1 - 1
  • [35] Computability and Complexity in Analysis
    Bauer, Andrej
    Hertling, Peter
    Ko, Ker-I
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2010, 16 (18) : 2495 - 2495
  • [36] RATIONALITY, COMPUTABILITY, AND COMPLEXITY
    RUSTEM, B
    VELUPILLAI, K
    JOURNAL OF ECONOMIC DYNAMICS & CONTROL, 1990, 14 (02): : 419 - 432
  • [37] Polynomial time approximation schemes and parameterized complexity
    Chen, Jianer
    Huang, Xiuzhen
    Kanj, Iyad A.
    Xia, Ge
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (02) : 180 - 193
  • [38] Polynomial time approximation schemes and parameterized complexity
    Chen, JN
    Huang, XZ
    Kanj, IA
    Xia, G
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS, 2004, 3153 : 500 - 512
  • [39] COMPOSITIONALITY, COMPUTABILITY, AND COMPLEXITY
    Pagin, Peter
    REVIEW OF SYMBOLIC LOGIC, 2021, 14 (03): : 551 - 591
  • [40] Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
    Fedor V. Fomin
    Petr A. Golovach
    Algorithmica, 2021, 83 : 2170 - 2214
12345