Three lines proof of the lower bound for the matrix rigidity

Details Three lines proof of the lower bound for the matrix rigidity Three lines proof of the lower bound for the matrix rigidity

2005-06-20

arxiv.org/abs/cs/0506081v2

Computer Science

Computational Complexity

4 pages

Scientific paper

The rigidity of a matrix describes the minimal number of entries one has to
change to reduce matrix's rank to r. We give very simple combinatorial proof of
the lower bound for the rigidity of Sylvester (special case of Hadamard) matrix
that matches the best known result by de Wolf(2005) for Hadamard matrices
proved by quantum information theoretical arguments.

Affiliated with

Also associated with

No associations

Rating

Three lines proof of the lower bound for the matrix rigidity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Three lines proof of the lower bound for the matrix rigidity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Three lines proof of the lower bound for the matrix rigidity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-104055