Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView
From MaRDI portal
Recommendations
- Applying relation algebra and RelView to solve problems on orders and lattices
- On computation complexity problems concerning relation algebras
- Algorithms for generating ordered solutions for explicit AND/OR structures
- Solving computational tasks on finite topologies by means of relation algebra and the \textsc{RelView} tool
- Relational representations of algebraic lattices and their applications
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
- Relational equations in totally ordered lattices and their complete resolution
- scientific article; zbMATH DE number 4217898
- On solving relational equations in Brouwerian lattices
- scientific article; zbMATH DE number 1953891
Cited in
(10)- The determination of subvarieties of certain congruence-distributive varieties
- Relation Algebra and RelView in Practical Use: Construction of Special University Timetables
- Multi-objective Problems in Terms of Relational Algebra
- Computing and Visualizing Closure Objects Using Relation Algebra and RelView
- scientific article; zbMATH DE number 4070969 (Why is no real title available?)
- Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
- An algorithm to minimize representations of finite order relations
- Solving computational tasks on finite topologies by means of relation algebra and the \textsc{RelView} tool
- Computing and Visualizing Lattices of Subgroups Using Relation Algebra and RelView
- Applying relation algebra and RelView to solve problems on orders and lattices
This page was built for publication: Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511094)
