Random lattices, threshold phenomena and efficient reduction algorithms

Author： Akhavi A.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.287, Iss.2, 2002-09, pp. : 359-385

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

Efficient algorithms for chemical threshold testing problems

By Bonis A.D.   Gargano L.   Vaccaro U.  

Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. : 493-511

Elsevier

Access to resources Recommend Favorite

Efficient Linkable and/or Threshold Ring Signature Without Random Oracles

By Yuen Tsz Hon   Liu Joseph K.   Au Man Ho   Susilo Willy   Zhou Jianying  

Computer Journal, Vol. 56, Iss. 4, 2013-04 ,pp. : 407-421

Oxford University Press

Access to resources Recommend Favorite

The Ajtai random class of lattices

By Cusick T.W.T.W.  

Theoretical Computer Science, Vol. 226, Iss. 1, 1999-09 ,pp. : 29-36

Elsevier

Access to resources Recommend Favorite

Comparing performance of algorithms for generating concept lattices

By Kuznetsov Sergei O.   Obiedkov Sergei A.  

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 14, Iss. 2-3, 2002-04 ,pp. : 189-216

Taylor & Francis Ltd

Access to resources Recommend Favorite

Algorithms for computing lengths of chains in integral partition lattices

By Wan H.   Wootton J.C.  

Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. : 783-800

Elsevier

Access to resources Recommend Favorite