On the complexity of approximating extremal determinants in matrices

Recommendations

On largest volume simplices and sub-determinants
The computational complexity of some problems of linear algebra
The (Non)enumerability of the determinant and the rank
Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard
On selecting a maximum volume sub-matrix of a matrix and related problems

Cited in

(25)

Phase retrieval from very few measurements
Uniform excess frames in Hilbert spaces
Optimal resilient sensor placement problem for secure state estimation
Cardinality minimization, constraints, and regularization: a survey
On the parameterized complexity of \textsc{Girth} and \textsc{Connectivity} problems on linear matroids
LWE with side information: attacks and concrete security estimation
Undirected determinant and its complexity
On the hardness of approximating the permanent of structured matrices
An easily computable upper bound on the Hoffman constant for homogeneous inequality systems
Sum-of-squares optimization without semidefinite programming
Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings
\(O(n\log^ 2n)\) determinant computation of a Toeplitz matrix and fast variance estimation
A primal-dual interior point method whose running time depends only on the constraint matrix
Deterministic APSP, Orthogonal Vectors, and More
scientific article; zbMATH DE number 7758358 (Why is no real title available?)
On the tractability of some natural packing, covering and partitioning problems
Subdeterminant maximization via nonconvex relaxations and anti-concentration
On the fraction of matrices with maximal additive complexity
On extremal behaviors of Murty's least index method
On the computational complexity of the secure state-reconstruction problem
Sampling-based dimension reduction for subspace approximation with outliers
The complexity of finding the minimal of the maximum cycle means of similar zero-one matrices
Scientific contributions of Leo Khachiyan (a short overview)
Supersaturated designs with the maximum number of factors for a given resolution-rank
Exponential inapproximability of selecting a maximum volume sub-matrix

This page was built for publication: On the complexity of approximating extremal determinants in matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346597)