Abstract
The rigidity of a matrix A for a target rank r over a field F is the minimum Hamming distance between A and a matrix of rank at most r. Rigidity is a classical concept in Computational Complexity Theory: constructions of rigid matrices are known to imply lower bounds of significant importance relating to arithmetic circuits. Yet, from the viewpoint of Parameterized Complexity, the study of central properties of matrices in general, and of the rigidity of a matrix in particular, has been neglected. In this paper, we conduct a comprehensive study of different aspects of the computation of the rigidity of general matrices in the framework of Parameterized Complexity. Naturally, given parameters r and k, the Matrix Rigidity problem asks whether the rigidity of A for the target rank r is at most k. We show that in case F equals the reals or F is any finite field, this problem is fixedparameter tractable with respect to k+r. To this end, we present a dimension reduction procedure, which may be a valuable primitive in future studies of problems of this nature. We also employ central tools in Real Algebraic Geometry, which are not well known in Parameterized Complexity, as a black box. In particular, we view the output of our dimension reduction procedure as an algebraic variety. Our main results are complemented by a W[1]hardness result and a subexponentialtime parameterized algorithm for a special case of Matrix Rigidity, highlighting the different flavors of this problem.
BibTeX  Entry
@InProceedings{fomin_et_al:LIPIcs:2017:7001,
author = {Fedor V. Fomin and Daniel Lokshtanov and S. M. Meesum and Saket Saurabh and Meirav Zehavi},
title = {{Matrix Rigidity from the Viewpoint of Parameterized Complexity}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {32:132:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770286},
ISSN = {18688969},
year = {2017},
volume = {66},
editor = {Heribert Vollmer and Brigitte Vallée},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7001},
URN = {urn:nbn:de:0030drops70019},
doi = {10.4230/LIPIcs.STACS.2017.32},
annote = {Keywords: Matrix Rigidity, Parameterized Complexity, Linear Algebra}
}
Keywords: 

Matrix Rigidity, Parameterized Complexity, Linear Algebra 
Seminar: 

34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) 
Issue Date: 

2017 
Date of publication: 

24.02.2017 