A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant

Author： Cryan M.   Dyer M.  

Publisher： Elsevier

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.67, Iss.2, 2003-09, pp. : 291-310

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

Polynomial-time counting and sampling of two-rowed contingency tables

By Dyer M.   Greenhill C.  

Theoretical Computer Science, Vol. 246, Iss. 1, 2000-09 ,pp. : 265-278

Elsevier

Access to resources Recommend Favorite

A Polynomial-Time Algorithm for Memory Space Reduction

By Song Yonghong   Wang Cheng   Li Zhiyuan  

International Journal of Parallel Programming, Vol. 33, Iss. 1, 2005-02 ,pp. : 1-33

Springer Publishing Company

Access to resources Recommend Favorite

A Polynomial-Time Parsing Algorithm for K -Depth Languages

By Cherubini A.   San Pietro P.  

Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. : 61-79

Academic Press

Access to resources Recommend Favorite

A polynomial-time algorithm for a flow-shop batching problem with equal-length operations

By Brucker Peter  

Journal of Scheduling, Vol. 14, Iss. 4, 2011-08 ,pp. : 371-389

Springer Publishing Company

Access to resources Recommend Favorite

Relating polynomial time to constant depth

By Vollmer H.  

Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. : 159-170

Elsevier

Access to resources Recommend Favorite