Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

FSTTCS
2009
Springer

favoriteEmaildiscussreport

100views Software Engineering» more FSTTCS 2009»

Using Elimination Theory to construct Rigid Matrices

13 years 11 months ago

Using Elimination Theory to construct Rigid Matrices

Download itcs.tsinghua.edu.cn

The rigidity of a matrix A for target rank r is the minimum number of entries of A that

Kumar Abhinav, Satyanarayana V. Lokam, Vijay M. Pa

Real-time Traffic

FSTTCS 2009 | Minimum Number | Target Rank | Theoretical Computer Science |

claim paper

Related Content

» Canonical Signed Calculi Nondeterministic Matrices and CutElimination

» Uniqueness of LowRank Matrix Completion by Rigidity Theory

» The Structure of Sparse Resultant Matrices

» A Triple Correspondence in Canonical Calculi Strong CutElimination Coherence and Nondeterm...

» The cocyclic Hadamard matrices of order less than 40

» Multihomogeneous resultant formulae for systems with scaled support

» On Feistel Structures Using a Diffusion Switching Mechanism

» Nondeterministic Multivalued Matrices for FirstOrder Logics of Formal Inconsistency

» Reed Muller Sensing Matrices and the LASSO

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	FSTTCS
Authors	Kumar Abhinav, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal M. N. Sarma

Comments (0)