Prev: How do I pronounce "Ngo Bao Chau" ?
Next: CALL FOR EDITORS-International Journal of Combinatorial Optimization Problems and Informatics
From: deepakc on 4 Feb 2010 11:50
Check out this paper - http://dspace.mit.edu/bitstream/handle/1721.1/46859/arcflowformulati00clau.pdf?sequence=1

The above paper appears to be a joint collaboration between MIT and a
French institute, published in 1987.

What I find interesting about this paper is that the authors mention
in the Conclusion on page 13, that they are uncertain about the
complexity of their algorithm. They also mention that the bound on the
number of steps of their algorithm is most probably exponential,
however, they are not certain about this. They also mention that P=NP
if the bound is polynomial.

Will some knowledgable person please be able to comment about this
paper.

Thanks,
-Deepak
 | 
Pages: 1
Prev: How do I pronounce "Ngo Bao Chau" ?
Next: CALL FOR EDITORS-International Journal of Combinatorial Optimization Problems and Informatics