Optimal decompositions of matrices with entries from residuated lattices

ISSN： 1465-363X

Source： Journal of Logic and Computation, Vol.22, Iss.6, 2012-12, pp. : 1405-1425

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Optimal constraint-based decision tree induction from itemset lattices

By Nijssen Siegfried Fromont Elisa

Data Mining and Knowledge Discovery, Vol. 21, Iss. 1, 2010-07 ,pp. : 9-51

Springer Publishing Company

Access to resources Recommend Favorite

From cascade decompositions to bit-vector algorithms

By Bergeron A. Hamel S.

Theoretical Computer Science, Vol. 313, Iss. 1, 2004-02 ,pp. : 3-16

Elsevier

Access to resources Recommend Favorite

Optimal algorithms for generalized searching in sorted matrices

By Hong S.

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 221-230

Elsevier

Access to resources Recommend Favorite

Efficient hierarchical identity-based signatures from lattices

By Tian Miaomiao Huang Liusheng Yang Wei

International Journal of Electronic Security and Digital Forensics, Vol. 5, Iss. 1, 2013-06 ,pp. : 1-10

Inderscience Publishers

Access to resources Recommend Favorite

From multiple sequent for additive linear logic to decision procedures for free lattices

By Marion J.-Y.

Theoretical Computer Science, Vol. 224, Iss. 1, 1999-08 ,pp. : 157-172

Elsevier

Access to resources Recommend Favorite