A polynomial algorithm for testing congruence modularity

International Journal of Algebra and Computation

Volumn 6, Issue 4, 1996, Pages 379-387

  Herrmann, Christian ^a   Wild, Marcel ^b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b Institut fuer Mathematik   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030487556     PISSN: 02181967     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218196796000210     Document Type: Article

References (5)

1. C. Herrmann, D. Pickering and M. Roddy, A geometric description of modular lattices, Algebra Universalis 31 (1994) 365-396.
2. D. Maier, The theory of relational databases, Comp. Sci. Press 1983.
3. M. Wild, A theory of finite closure spaces based on implications, Advances in Mathematics 108 (1994) 118-139.
4. M. Wild, Computations with finite closure systems and implications, Lect. Notes in Comp. Sci. 959 (1995) 111-120.
5. M. Wild, The minimal number of join irreducibles of a finite modular lattice, Algebra Universalis 35 (1996) 113-123.