Re: A letter want to disprove my paper which submitted recently
- From: deepakc <deepakc@xxxxxxxxxxxxxxxx>
- Date: Fri, 22 Jun 2007 07:43:00 -0700
Hi Zhu, I read your paper, and it is very interesting.
On page 8 of your article on "http://arxiv.org/PS_cache/arxiv/pdf/
0704/0704.0309v2.pdf", first line, you have mentioned that complexity
of calculating the rank of a matrix is O(N^3). As the complexities of
all other subsets of your Algorithm are lesser than O(N^3), so
therefore you have concluded that overall complexity of your Algorithm
= O (N^3).
Can u please indicate some papers or references, which say that
calculating the rank of a matrix is O(N^3) ?
So far, I thought that calculating the rank of a Generic matrix within
polynomial time, is an unsolved OPEN problem.
One famous paper which states that this is an OPEN problem is
Yannakakis paper (see last paragraph of the paper) - "Expressing
combinatorial optimization problems by linear programs".
.
- Follow-Ups:
- References:
- A letter want to disprove my paper which submitted recently
- From: Zhu Guohun
- Re: A letter want to disprove my paper which submitted recently
- From: Rod Howell
- Re: A letter want to disprove my paper which submitted recently
- From: tchow
- Re: A letter want to disprove my paper which submitted recently
- From: Zhu Guohun
- A letter want to disprove my paper which submitted recently
- Prev by Date: Re: enumeration of matching
- Next by Date: Re: A letter want to disprove my paper which submitted recently
- Previous by thread: Re: A letter want to disprove my paper which submitted recently
- Next by thread: Re: A letter want to disprove my paper which submitted recently
- Index(es):
Relevant Pages
|
