The reduction algorithm of formal context that corresponding to concept lattice is extended.
对概念格对应的形式背景约简的算法加以扩展。
This l-reduced lattice reduction algorithm can find vectors shorter than ones got by the standard LLL algorithm which is widely used in this field.
利用这种新型算法找到的短向量比使用标准LLL规约算法求得的短向量更加接近格中的最短非零向量。
应用推荐