ON SEMIGROUPS WITH PSPACE-COMPLETE SUBPOWER MEMBERSHIP PROBLEM

被引:1
|
作者
Steindl, Markus [1 ,2 ]
机构
[1] Johannes Kepler Univ Linz, Inst Algebra, Altenberger St 69, A-4040 Linz, Austria
[2] Univ Colorado, Dept Math, Campus Box 395, Boulder, CO 80309 USA
基金
奥地利科学基金会;
关键词
subalgebras of powers; membership test; computational complexity; PSPACE-complete; NP-complete;
D O I
10.1017/S1446788718000010
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Fix a finite semigroup S and let a(1), ..., a(k), b be tuples in a direct power S-n. The subpower membership problem (SMP) for S asks whether b can be generated by a(1), ..., a(k). For combinatorial Rees matrix semigroups we establish a dichotomy result: if the corresponding matrix is of a certain form, then the SMP is in P; otherwise it is NP-complete. For combinatorial Rees matrix semigroups with adjoined identity, we obtain a trichotomy: the SMP is either in P, NP-complete, or PSPACE-complete. This result yields various semigroups with PSPACE-complete SMP including the six-element Brandt monoid, the full transformation semigroup on three or more letters, and semigroups of all n by n matrices over a field for n >= 2.
引用
收藏
页码:127 / 142
页数:16
相关论文
共 50 条
  • [21] Integer circuit evaluation is PSPACE-complete
    Yang, K
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 63 (02) : 288 - 303
  • [22] Presburger modal logic is PSPACE-complete
    Demri, Stephane
    Lugiez, Denis
    AUTOMATED REASONING, PROCEEDINGS, 2006, 4130 : 541 - 556
  • [23] Deciding Universality of ptNFAs is PSPACE-Complete
    Masopust, Tomas
    Krotzsch, Markus
    SOFSEM 2018: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2018, 10706 : 413 - 427
  • [24] Online Chromatic Number is PSPACE-Complete
    Boehm, Martin
    Vesely, Pavel
    Combinatorial Algorithms, 2016, 9843 : 16 - 28
  • [25] Online Chromatic Number is PSPACE-Complete
    Bohm, Martin
    Vesely, Pavel
    THEORY OF COMPUTING SYSTEMS, 2018, 62 (06) : 1366 - 1391
  • [26] Stochastic Muller games are PSPACE-complete
    Chatterjee, Krishnendu
    FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007, 4855 : 436 - 448
  • [27] Friends-and-strangers is PSPACE-complete
    Yang, Chao
    Zhang, Zhujun
    INFORMATION PROCESSING LETTERS, 2025, 190
  • [28] Everything is PSPACE-complete in interaction systems
    Majster-Cederbaum, Mila
    Minnameier, Christoph
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2008, PROCEEDINGS, 2008, 5160 : 216 - 227
  • [29] Optimizing the Region Algebra is PSPACE-complete
    Gelade, Wouter
    Neven, Frank
    INFORMATION PROCESSING LETTERS, 2010, 110 (16) : 639 - 643
  • [30] Convergence of Opinion Diffusion is PSPACE-Complete
    Chistikov, Dmitry
    Lisowski, Grzegorz
    Paterson, Mike
    Turrini, Paolo
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 7103 - 7110