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

Satisfying subtype inequalities in polynomial space

By Frey A.  

Theoretical Computer Science, Vol. 277, Iss. 1, 2002-04 ,pp. : 105-117

Elsevier

Access to resources Recommend Favorite

Complete Solutions and Extremality Criteria to Polynomial Optimization Problems

By Gao David  

Journal of Global Optimization, Vol. 35, Iss. 1, 2006-05 ,pp. : 131-143

Springer Publishing Company

Access to resources Recommend Favorite

The bounded-complete hull of an -space

By Ershov Y.L.  

Theoretical Computer Science, Vol. 175, Iss. 1, 1997-03 ,pp. : 3-13

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