On the complexity of approximating extremal determinants in matrices
From MaRDI portal
Publication:1346597
DOI10.1006/jcom.1995.1005zbMath0819.65085OpenAlexW2005482089MaRDI QIDQ1346597
Publication date: 5 April 1995
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1995.1005
Numerical computation of determinants (65F40) Complexity and performance of numerical algorithms (65Y20)
Related Items (15)
On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids ⋮ A primal-dual interior point method whose running time depends only on the constraint matrix ⋮ Optimal resilient sensor placement problem for secure state estimation ⋮ An easily computable upper bound on the Hoffman constant for homogeneous inequality systems ⋮ Unnamed Item ⋮ Phase retrieval from very few measurements ⋮ Sampling-based dimension reduction for subspace approximation with outliers ⋮ Sum-of-Squares Optimization without Semidefinite Programming ⋮ On the tractability of some natural packing, covering and partitioning problems ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ Uniform excess frames in Hilbert spaces ⋮ Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration ⋮ On the computational complexity of the secure state-reconstruction problem ⋮ Supersaturated designs with the maximum number of factors for a given resolution-rank ⋮ LWE with side information: attacks and concrete security estimation
This page was built for publication: On the complexity of approximating extremal determinants in matrices
