Pages that link to "Item:Q802020"

The following pages link to Complexity of the word problem for commutative semigroups of fixed dimension (Q802020):

Displaying 9 items.

• Space functions and space complexity of the word problem in semigroups. (Q395608) (← links)
• Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states (Q1096388) (← links)
• An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems (Q1097037) (← links)
• Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups. (Q1854344) (← links)
• Improved lower bounds for the complexity of finite semigroups (Q2559565) (← links)
• (Q3115565) (← links)
• (Q4406627) (← links)
• Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria (Q5055938) (← links)
• The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups (Q5055940) (← links)