Re: A letter want to disprove my paper which submitted recently


deepakc

Hello Zhu,

I am sorry for my above 2 posts.
Actually, I am not very good in the subject of MATRIX RANK.
The rank of binary matrix could be simplify obtaining by Echolon
method which is O(n^3), when I study the Hamiltonian cycle at
beginning, I had coding this function and implmenent by Java
( existence a little bug when meet zero line or zero column). From
June, 2006, I had tun to using Jama-1.0.2, thus give up improve the
coding.

And also there are several paper when I was in Tokyo and learning
from library had mention the complexity of rank of matrix, The
results is only O(n^3). but now I could only find one of its from
google

I.S. Dhillon, A new O(n^2) algorithm for the symmetric tridiagonal
eigenvalue/- eigenvector problem, PhD. thesis, University of
California, Berkeley, 1997. http://citeseer.ist.psu.edu/new97algorithm.html





Actually, I completed my Bachelor Degree in 2003 in the subject of
Electrical & Electronic Engineering, so my background in Mathematics
is not very strong.

So, please tell us, have u submitted ur paper to any Journal/
Conference ?
I could understand your question. I had register and prepare to
discuss my draft in the "The First Announcement International
Symposium on Graph Theory and Combinatorial Algorithms " (http://
www.amt.ac.cn/tulun/enews.htm).

The reseaon select this Symposium is very cheap for me. If no one
could disprove my results after this symposium or from comp.theory,
I will submit it to a Journal, but I don't know which Journal is very
nice for this kind of paper.

I believe my results is correctly, since I had another different
method to prove HC in polynomial, even including others NPC problem
(proof without transform from HC).

Thank you for your giving me strength on this problem.

Sincerely,
Zhu

.

Relevant Pages

  • Re: A letter want to disprove my paper which submitted recently
    ... The rank of binary matrix could be simplify obtaining by Echolon ... so my background in Mathematics ... Symposium on Graph Theory and Combinatorial Algorithms ". ... algorithm and use it to crack every RSA crypto on the planet. ...
    (comp.theory)
  • Re: A letter want to disprove my paper which submitted recently
    ... The rank of binary matrix could be simplify obtaining by Echolon ... Symposium on Graph Theory and Combinatorial Algorithms ". ... Transform your solution to a polynomial-time prime-factorizing ... algorithm and use it to crack every RSA crypto on the planet. ...
    (comp.theory)