Experimental investigation of sufficient criteria for relations to have kernels
From MaRDI portal
Publication:2695346
DOI10.1007/978-3-030-88701-8_5OpenAlexW3210757811MaRDI QIDQ2695346
Rudolf Berghammer, Mitja Kulczynski
Publication date: 30 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-88701-8_5
Related Items (1)
Uses Software
Cites Work
- Deriving relational programs for computing kernels by reconstructing a proof of Richardson's theorem
- Recent problems and results about kernels in directed graphs
- Solutions of irreflexive relations
- A lattice-theoretical fixpoint theorem and its applications
- A characterization of complete lattices
- Computer Algebra in Scientific Computing
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Experimental investigation of sufficient criteria for relations to have kernels