Pages that link to "Item:Q1770618"
From MaRDI portal
The following pages link to Checking quasi-identities in a finite semigroup may be computationally hard. (Q1770618):
Displaying 8 items.
- The complexity of checking the polynomial completeness of finite quasigroups (Q783116) (← links)
- Complexity of the identity checking problem for finite semigroups. (Q843593) (← links)
- Word problem of the Perkins semigroup via directed acyclic graphs. (Q953264) (← links)
- Verifying nonrigidity (Q1072373) (← links)
- Testing for a semilattice term (Q1732802) (← links)
- Complexity issues of checking identities in finite monoids (Q2655464) (← links)
- Checking identities is computationally intractable NP-hard and therefore human provers will always be needed (Q3156861) (← links)
- INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS (Q5470161) (← links)