The following pages link to (Q3703918):
Displaying 15 items.
- Abstract derivation of transitive closure algorithms (Q287162) (← links)
- Control of Condorcet voting: complexity and a relation-algebraic approach (Q319803) (← links)
- Relational style laws and constructs of linear algebra (Q406445) (← links)
- Solving computational tasks on finite topologies by means of relation algebra and the \textsc{RelView} tool (Q516028) (← links)
- Abstract representation theorems for demonic refinement algebras (Q604454) (← links)
- A relation-algebraic approach to simple games (Q631101) (← links)
- Embedding a demonic semilattice in a relation algebra (Q672711) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Relation algebras: Concept of points and representability (Q1063597) (← links)
- Semantic distance between specifications (Q1583257) (← links)
- Characterizing determinacy in Kleene algebras (Q1602558) (← links)
- An algebraic framework for minimum spanning tree problems (Q1786562) (← links)
- Compiling dyadic first-order specifications into map algebra (Q1870581) (← links)
- Monomorphic characterization of \(n\)-ary direct products (Q1961870) (← links)
- State space analysis of Petri nets with relation-algebraic methods (Q2518607) (← links)
