Pages that link to "Item:Q1212557"
From MaRDI portal
The following pages link to Finite binary relations have no more complexity than finite functions (Q1212557):
Displaying 5 items.
- Representation theory of finite semigroups over semirings. (Q657946) (← links)
- Idempotent Boolean matrices (Q1147203) (← links)
- Another semigroup of complexity \(n-1\) (Q1176628) (← links)
- A reduction theorem for complexity of finite semigroups (Q1216474) (← links)
- The group-theoretic complexity of subsemigroups of Boolean matrices (Q1255585) (← links)