A Polynomial-Time Algorithm for Memory Space Reduction

Author： Song Yonghong   Wang Cheng   Li Zhiyuan  

Publisher： Springer Publishing Company

ISSN： 0885-7458

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

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

A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems

By DasGupta  

Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. : 161-189

Elsevier

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

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

By Cryan M.   Dyer M.  

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

Elsevier

Access to resources Recommend Favorite

A Polynomial-Time Algorithm to Find von Neumann-Morgenstern Stable Matchings in Marriage Games

By Wako Jun  

Algorithmica, Vol. 58, Iss. 1, 2010-09 ,pp. : 188-220

Springer Publishing Company

Access to resources Recommend Favorite