Author： Wild Marcel
Publisher： Taylor & Francis Ltd
ISSN： 1607-3606
Source： Quaestiones Mathematicae, Vol.23, Iss.2, 2000-06, pp. : 153-161
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Each finite closure system, whence each finite lattice, can be described in terms of "implicational bases" (called "covers of functional dependencies" in relational database theory). Although a NP - complete problem in general, it turns out that for modular lattices an optimal implicational base can be computed in polynomial time.
Related content
Finite Fields and Their Applications, Vol. 7, Iss. 4, 2001-10 ,pp. :
Access to resources
Recommend
Finite Modular Effect Algebras
By Sykes S.R.
Advances in Applied Mathematics, Vol. 19, Iss. 2, 1997-08 ,pp. :
On tolerance lattices of algebras in congruence modular varieties
By Czédli G. Horváth E. Radeleczki S.
Acta Mathematica Hungarica, Vol. 100, Iss. 1-2, 2003-07 ,pp. :
On Finite Elements in Lattices of Regular Operators
By Chen Zi
Positivity, Vol. 11, Iss. 4, 2007-11 ,pp. :