Optimal implicational bases for finite modular lattices
作者:
Marcel Wild,
期刊:
Quaestiones Mathematicae
(Taylor Available online 2000)
卷期:
Volume 23,
issue 2
页码: 153-161
ISSN:1607-3606
年代: 2000
DOI:10.2989/16073600009485964
出版商: Taylor & Francis Group
关键词: MODULAR LATTICES;NP-COMPLETE;RELATIONAL DATABASES;FUNCTIONAL DEPENDENCIES
数据来源: Taylor
摘要:
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 formodularlattices an optimal implicational base can be computed in polynomial time.
点击下载:
PDF (144KB)
返 回