Matrix Rigidity from the Viewpoint of Parameterized Complexity

DOI10.4230/LIPIcs.STACS.2017.32zbMath1402.68090OpenAlexW2605233630MaRDI QIDQ4636630

Meirav Zehavi, Daniel Lokshtanov, Fedor V. Fomin, Saket Saurabh, Syed M. Meesum

Publication date: 19 April 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2017.32

zbMATH Keywords

parameterized complexitymatrix rigidity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Computational aspects of higher-dimensional varieties (14Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Parameterized Low-Rank Binary Matrix Approximation

This page was built for publication: Matrix Rigidity from the Viewpoint of Parameterized Complexity