Generating Boolean lattices with few elements and exchanging session keys
From MaRDI portal
Cites work
- (1+1+2)-generated lattices of quasiorders
- \((1+1+2)\)-generated equivalence lattices
- A concise approach to small generating sets of lattices of quasiorders and transitive relations
- A note on representation of lattices by weak congruences
- Average Case Complete Problems
- Ein Satz über Untermengen einer endlichen Menge.
- Four-element generating sets of partition lattices and their direct products
- Four-generated direct powers of partition lattices and authentication
- Four-generated quasiorder lattices and their atoms in a four-generated sublattice
- Generating some large filters of quasiorder lattices
- scientific article; zbMATH DE number 3987347 (Why is no real title available?)
- scientific article; zbMATH DE number 4031760 (Why is no real title available?)
- scientific article; zbMATH DE number 3765849 (Why is no real title available?)
- scientific article; zbMATH DE number 3570510 (Why is no real title available?)
- scientific article; zbMATH DE number 1006211 (Why is no real title available?)
- scientific article; zbMATH DE number 1072538 (Why is no real title available?)
- scientific article; zbMATH DE number 942667 (Why is no real title available?)
- Lattice generation of small equivalences of a countable set
- Lattice Theory: Foundation
- Projective and injective distributive lattices
- Quasiorder lattices are five-generated
- Sur l'état actuel de l'axiomatique de la théorie des ensembles.
- Three-generated quasiorder lattices
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
This page was built for publication: Generating Boolean lattices with few elements and exchanging session keys
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7237558)