The Complexity of Counting Problems in Equational Matching

被引：0
|
作者：
Hermann, M.
Kolaitis, P. G.
机构：
来源：
Journal of Symbolic Computation | / 20卷 / 03期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] ON THE COMPLEXITY OF A FAMILY OF GENERALIZED MATCHING PROBLEMS
    LAI, TH
    SPRAGUE, A
    DISCRETE APPLIED MATHEMATICS, 1985, 12 (03) : 303 - 318
  • [22] Complexity of nilpotent unification and matching problems
    Guo, Q
    Narendran, P
    Wolfram, DA
    INFORMATION AND COMPUTATION, 2000, 162 (1-2) : 3 - 23
  • [23] Complexity of Cycle Transverse Matching Problems
    Churchley, Ross
    Huang, Jing
    Zhu, Xuding
    COMBINATORIAL ALGORITHMS, 2011, 7056 : 135 - +
  • [24] Renyi entropies as a measure of the complexity of counting problems
    Chamon, Claudio
    Mucciolo, Eduardo R.
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2013,
  • [25] The Complexity of Counting Problems Over Incomplete Databases
    Arenas, Marcelo
    BarcelO, Pablo
    Monet, Mikael
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2021, 22 (04)
  • [26] On the complexity of equational decision problems for finite height complemented and orthocomplemented modular lattices
    Herrmann, Christian
    ALGEBRA UNIVERSALIS, 2022, 83 (01)
  • [27] LOW GROWTH EQUATIONAL COMPLEXITY
    Jackson, Marcel
    PROCEEDINGS OF THE EDINBURGH MATHEMATICAL SOCIETY, 2019, 62 (01) : 197 - 210
  • [28] On the complexity of equational horn clauses
    Verma, KN
    Seidl, H
    Schwentick, T
    AUTOMATED DEDUCTION - CADE-20, PROCEEDINGS, 2005, 3632 : 337 - 352
  • [29] On the complexity of equational decision problems for finite height complemented and orthocomplemented modular lattices
    Christian Herrmann
    Algebra universalis, 2022, 83
  • [30] The Complexity of Linear and Stratified Context Matching Problems
    Manfred Schmidt-Schauß
    Jürgen Stuber
    Theory of Computing Systems, 2004, 37 : 717 - 740
12345