Campus Event Calendar
Event Entry
What and Who
On the complexity of changing matrix rank
Meena Mahajan
The Institute of Mathematical Sciences, Chennai, India
Lecture
AG 1, AG 2, AG 3, AG 4, AG 5, SWS
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 7 November 2006
13:30
30 Minutes
E1 4
024
Saarbrücken
Abstract
The problem of Decrease-Rank is: given a matrix M and
numbers r,k, decide whether the rank of M be brought to
below r by changing at most k entries of M. This is a
computational version of the well-studied notion of matrix
rigidity. The talk will survey some of the known results
concerning this problem.
Contact
Khaled Elbassioni
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
Computational Complexity; Linear Algebra; Matrix Rank; Rigidity
Meena Mahajan, 11/03/2006 21:12
Khaled Elbassioni, 11/03/2006 14:26
Khaled Elbassioni, 11/03/2006 14:24 -- Created document.
Khaled Elbassioni, 11/03/2006 14:26
Khaled Elbassioni, 11/03/2006 14:24 -- Created document.