Pages that link to "Item:Q1770618"

The following pages link to Checking quasi-identities in a finite semigroup may be computationally hard. (Q1770618):

Displaying 2 items.

• Word problem of the Perkins semigroup via directed acyclic graphs. (Q953264) (← links)
• INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS (Q5470161) (← links)