scientific article; zbMATH DE number 7204284
From MaRDI portal
Publication:5111164
DOI10.4230/LIPICS.CCC.2017.33zbMATH Open1440.68330MaRDI QIDQ5111164FDOQ5111164
Authors: Markus Bläser, Gorav Jindal, Anurag Pandey 
Publication date: 26 May 2020
Title of this publication is not available (Why is that?)
Recommendations
- A deterministic PTAS for the commutative rank of matrix spaces
- Still another rank determination of set intersection matrices with an application in communication complexity
- scientific article; zbMATH DE number 5494051
- On the Complexity of Matrix Rank and Rigidity
- On the complexity of matrix rank and rigidity
- A note on monotone complexity and the rank of matrices
- A deterministic PTAS for the algebraic rank of bounded degree polynomials
- Fast greedy for linear matroids
- Greedy Givens algorithms for computing the rank-k updating of the QR decomposition
- Maximal rank in matrix spaces via graph matchings
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Vector spaces, linear dependence, rank, lineability (15A03)
Cited In (7)
- An exponential lower bound for the degrees of invariants of cubic forms and tensor actions
- Constructive non-commutative rank computation is in deterministic polynomial time
- Operator scaling: theory and applications
- A deterministic PTAS for the algebraic rank of bounded degree polynomials
- Still another rank determination of set intersection matrices with an application in communication complexity
- A deterministic PTAS for the commutative rank of matrix spaces
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111164)
