Approximating the number of linear extensions

Author： Ewacha K.   Rival I.   Zaguia N.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.175, Iss.2, 1997-04, pp. : 271-282

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

Approximating Points by a Piecewise Linear Function

By Chen Danny  

Algorithmica, Vol. 66, Iss. 3, 2013-07 ,pp. : 682-713

Springer Publishing Company

Access to resources Recommend Favorite

Approximating the number of frequent sets in dense data

By Boley Mario   Grosskreutz Henrik  

Knowledge and Information Systems, Vol. 21, Iss. 1, 2009-10 ,pp. : 65-89

Springer Publishing Company

Access to resources Recommend Favorite

Z‐Number‐Based Linear Programming

By  

INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, Vol. 30, Iss. 5, 2015-05 ,pp. : 563-589

John Wiley & Sons Inc

Access to resources Recommend Favorite

Multilingual rule-based approach to number expansion: Framework, extensions and application

By Moberg Marko   Pärssinen Kimmo  

International Journal of Speech Technology, Vol. 9, Iss. 1-2, 2007-03 ,pp. : 29-40

Springer Publishing Company

Access to resources Recommend Favorite

Clifford algebras and approximating the permanent

By Chien S.   Rasmussen L.   Sinclair A.  

Journal of Computer and System Sciences, Vol. 67, Iss. 2, 2003-09 ,pp. : 263-290

Elsevier

Access to resources Recommend Favorite