Some complexity bounds for subtype inequalities

By Benke M.  

Theoretical Computer Science, Vol. 212, Iss. 1, 1999-02 ,pp. : 3-27

Elsevier

Access to resources Recommend Favorite

Infiniteness of proof( ) is polynomial-space complete

By Hirokawa S.  

Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. : 331-339

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

Fast Polynomial-Space Algorithms Using Inclusion-Exclusion: Improving on Steiner Tree and Related Problems

By Nederlof Jesper  

Algorithmica, Vol. 65, Iss. 4, 2013-04 ,pp. : 868-884

Springer Publishing Company

Access to resources Recommend Favorite

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