Packing problems, dimensions and the tensor product of complete lattices
From MaRDI portal
Publication:2670899
Recommendations
Cites work
- An Algorithm for the Vertex Packing Problem
- From graphs to ortholattices and equivariant maps
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3604940 (Why is no real title available?)
- scientific article; zbMATH DE number 877297 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- Negations and contrapositions of complete lattices
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Tensorial decomposition of concept lattices
- The maximum clique problem
- Varieties generated by lattices of breadth two
- VC-dimensions for graphs (extended abstract)
Cited in
(8)- The packing problem in statistics, coding theory and finite projective spaces
- Optimization problems on posets with regard to formal concept analysis
- Lattice packings through division algebras
- On packings of \((n,k)\)-products
- PROJECTION-NET WIDTHS AND LATTICE PACKINGS
- Packing of (0, 1)-matrices
- Structure Induced on Subsets of a Lattice Via Information Gathered from Tensor Products
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
This page was built for publication: Packing problems, dimensions and the tensor product of complete lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2670899)