Pages that link to "Item:Q1329260"
From MaRDI portal
The following pages link to On computation complexity problems concerning relation algebras (Q1329260):
Displaying 9 items.
- Complexity of equational theory of relational algebras with standard projection elements (Q514569) (← links)
- The complexity of constraint satisfaction problems for small relation algebras (Q814599) (← links)
- On a new high dimensional Weisfeiler-Lehman algorithm (Q1296386) (← links)
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Q1377625) (← links)
- (Q3364101) (← links)
- Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView (Q3511094) (← links)
- (Q4415076) (← links)
- (Q5393788) (← links)
- The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom (Q5870532) (← links)