On reducibility and symmetry of disjoint NP pairs

Author： Pudlak P.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.295, Iss.1, 2003-02, pp. : 323-339

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

Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths

By Banerjee S.   Ghosh R.K.   Reddy A.P.K.  

Journal of Parallel and Distributed Computing, Vol. 33, Iss. 2, 1996-03 ,pp. : 165-171

Academic Press

Access to resources Recommend Favorite

Reducibility classes of P-selective sets

By Hemaspaandra L.A.   Hoene A.   Ogihara M.  

Theoretical Computer Science, Vol. 155, Iss. 2, 1996-03 ,pp. : 447-457

Elsevier

Access to resources Recommend Favorite

On Finding Min-Min Disjoint Paths

By Guo Longkun  

Algorithmica, Vol. 66, Iss. 3, 2013-07 ,pp. : 641-653

Springer Publishing Company

Access to resources Recommend Favorite

NP &unknown; co-NP and models of arithmetic

By Sureson C.  

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 55-67

Elsevier

Access to resources Recommend Favorite

P, NP, Co-NP and weak systems of arithmetic

By Sureson C.  

Theoretical Computer Science, Vol. 154, Iss. 2, 1996-02 ,pp. : 145-163

Elsevier

Access to resources Recommend Favorite