A compact representation for modular semilattices and its applications
From MaRDI portal
Publication:2006979
DOI10.1007/s11083-019-09516-0zbMath1484.06015arXiv1705.05781OpenAlexW3085082021MaRDI QIDQ2006979
Publication date: 12 October 2020
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.05781
Related Items (2)
A nonpositive curvature property of modular semilattices ⋮ Enumerating maximal consistent closed sets in closure systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The joy of implications, aka pure Horn formulas: mainly a survey
- Geodesics in CAT(0) cubical complexes
- Median graphs, parallelism and posets
- Petri nets, event structures and domains. I
- A geometric description of modular lattices
- A theory of finite closure spaces based on implications
- Constructive non-commutative rank computation is in deterministic polynomial time
- A compact representation for minimizers of \(k\)-submodular functions
- Computing DM-decomposition of a partitioned matrix with rank-1 blocks
- Operator scaling: theory and applications
- Combinatorial theory.
- Submodular functions and optimization.
- Theory of Principal Partitions Revisited
- Foundations of Incidence Geometry
- Towards Minimizing k-Submodular Functions
- Varieties with few subalgebras of powers
- Canonical Horn Representations and Query Learning
- Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations
- A POLYNOMIAL ALGORITHM FOR TESTING CONGRUENCE MODULARITY
- Minimum Covers in Relational Database Model
- Modular Interval Spaces
- Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations
- Optimal implicational bases for finite modular lattices
- L-CONVEXITY ON GRAPH STRUCTURES
- Discrete Convex Functions on Graphs and Their Algorithmic Applications
- The Power of Linear Programming for General-Valued CSPs
- Medians and Betweenness
- Matrices and matroids for systems analysis
- Discrete convexity and polynomial solvability in minimum 0-extension problems
This page was built for publication: A compact representation for modular semilattices and its applications