The Complexity of Counting Problems in Equational Matching

被引：0
|
作者：
Hermann, M.
Kolaitis, P. G.
机构：
来源：
Journal of Symbolic Computation | / 20卷 / 03期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] The Complexity of Perfect Matching Problems on Dense Hypergraphs
    Karpinski, Marek
    Rucinski, Andrzej
    Szymanska, Edyta
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 626 - +
  • [32] The complexity of linear and stratified context matching problems
    Schmidt-Schauss, M
    Stuber, J
    THEORY OF COMPUTING SYSTEMS, 2004, 37 (06) : 717 - 740
  • [33] Computational Complexity of Simultaneous Elementary Matching Problems
    Miki Hermann
    Phokion G. Kolaitis
    Journal of Automated Reasoning, 1999, 23 : 107 - 136
  • [34] Computational complexity of simultaneous elementary matching problems
    Hermann, M
    Kolaitis, PG
    JOURNAL OF AUTOMATED REASONING, 1999, 23 (02) : 107 - 136
  • [35] Nominal Equational Problems
    Ayala-Rincon, Mauricio
    Fernandez, Maribel
    Nantes-Sobrinho, Daniele
    Vale, Deivid
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2021, 2021, 12650 : 22 - 41
  • [36] Subtractive reductions and complete problems for counting complexity classes
    Durand, A
    Hermann, M
    Kolaitis, PG
    THEORETICAL COMPUTER SCIENCE, 2005, 340 (03) : 496 - 513
  • [37] A computational proof of complexity of some restricted counting problems
    Cai, Jin-Yi
    Lu, Pinyan
    Xia, Mingji
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (23) : 2468 - 2485
  • [38] A Computational Proof of Complexity of Some Restricted Counting Problems
    Cai, Jin-Yi
    Pinyan, L.
    Xia, Mingji
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 138 - +
  • [39] Complexity of fixed point counting problems in Boolean networks
    Bridoux, Florian
    Durbec, Amelia
    Perrot, Kevin
    Richard, Adrien
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2022, 126 : 138 - 164
  • [40] EQUATIONAL PROBLEMS AND DISUNIFICATION
    COMON, H
    LESCANNE, P
    JOURNAL OF SYMBOLIC COMPUTATION, 1989, 7 (3-4) : 371 - 425
12345