The Complexity of Counting Problems in Equational Matching

被引：0
|
作者：
Hermann, M.
Kolaitis, P. G.
机构：
来源：
Journal of Symbolic Computation | / 20卷 / 03期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] The complexity of counting problems in equational matching
    Hermann, M
    Kolaitis, PG
    JOURNAL OF SYMBOLIC COMPUTATION, 1995, 20 (03) : 343 - 362
  • [2] On the complexity of equational problems in CNF
    Pichler, R
    JOURNAL OF SYMBOLIC COMPUTATION, 2003, 36 (1-2) : 235 - 269
  • [3] The complexity of counting problems
    Welsh, D
    Gale, A
    ASPECTS OF COMPLEXITY: MINICOURSES IN ALGORITHMICS, COMPLEXITY AND COMPUTATIONAL ALGEBRA, 2001, 4 : 115 - 153
  • [4] COMPLEXITY OF MATCHING PROBLEMS
    BENANAV, D
    KAPUR, D
    NARENDRAN, P
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 202 : 417 - 429
  • [5] COMPLEXITY OF MATCHING PROBLEMS
    BENANAV, D
    KAPUR, D
    NARENDRAN, P
    JOURNAL OF SYMBOLIC COMPUTATION, 1987, 3 (1-2) : 203 - 216
  • [6] Progress in Complexity of Counting Problems
    Cai, Jin-Yi
    FRONTIERS IN ALGORITHMICS AND ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, (FAW-AAIM 2011), 2011, 6681 : 1 - 3
  • [7] The parameterized complexity of counting problems
    Flum, J
    Grohe, M
    SIAM JOURNAL ON COMPUTING, 2004, 33 (04) : 892 - 922
  • [8] The complexity of planar counting problems
    Hunt, HB
    Marathe, MV
    Radhakrishnan, V
    Stearns, RE
    SIAM JOURNAL ON COMPUTING, 1998, 27 (04) : 1142 - 1167
  • [9] The parameterized complexity of counting problems
    Flum, J
    Grohe, M
    FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 538 - 547
  • [10] Counting Problems in Parameterized Complexity
    Zhang, Chihao
    Chen, Yijia
    TSINGHUA SCIENCE AND TECHNOLOGY, 2014, 19 (04) : 410 - 420
12345