On the public citation graph

On the Complexity of Approximating Extremal Determinants in Matrices

0 signed · 84 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf02574027openalex-snapshot
Better lower bounds on detecting affine and spherical degeneracies
inferredcites →https://doi.org/10.1016/0024-3795(89)90594-6openalex-snapshot
On scaled projections and pseudoinverses
inferredcites →https://doi.org/10.1016/0024-3795(90)90056-iopenalex-snapshot
On bounds for scaled projections and pseudoinverses
inferredcites →https://doi.org/10.1016/0167-6377(82)90006-2openalex-snapshot
Some NP-complete problems in linear programming
inferredcites →https://doi.org/10.1016/0167-6377(82)90038-4openalex-snapshot
A good submatrix is hard to find
inferredcites →https://doi.org/10.1016/0167-6377(95)00019-gopenalex-snapshot
Condition numbers for polyhedra with real number data
inferredcites →https://doi.org/10.1080/03081088508817636openalex-snapshot
Semi-optimal bases for linear dependencies
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1145/195058.195248openalex-snapshot
An accelerated interior point method whose running time depends only on A (extended abstract)
inferredcites →https://doi.org/10.1287/opre.38.6.1006openalex-snapshot
A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-63890-3_36openalex-snapshot
On defect sets in bipartite graphs (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-3-030-53262-8_10openalex-snapshot
Improving Proximity Bounds Using Sparsity
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_12openalex-snapshot
LWE with Side Information: Attacks and Concrete Security Estimation
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_1openalex-snapshot
Subspace Approximation with Outliers
inferred← citeshttps://doi.org/10.1007/978-3-319-20188-7_5openalex-snapshot
Phase Transitions in Phase Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_47openalex-snapshot
On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_27openalex-snapshot
On the Complexity of Matroid Isomorphism Problems
inferred← citeshttps://doi.org/10.1007/bf02592148openalex-snapshot
A primal-dual interior point method whose running time depends only on the constraint matrix
inferred← citeshttps://doi.org/10.1007/s00025-018-0871-0openalex-snapshot
Uniform Excess Frames in Hilbert Spaces
inferred← citeshttps://doi.org/10.1007/s101070050087openalex-snapshot
Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard
inferred← citeshttps://doi.org/10.1007/s10208-002-0076-4openalex-snapshot
Vandermonde Matrices, NP-Completeness, and Transversal Subspaces
inferred← citeshttps://doi.org/10.1007/s10589-023-00514-yopenalex-snapshot
An easily computable upper bound on the Hoffman constant for homogeneous inequality systems
inferred← citeshttps://doi.org/10.1007/s10623-024-01542-3openalex-snapshot
Relating code equivalence to other isomorphism problems
inferred← citeshttps://doi.org/10.1016/j.automatica.2021.110083openalex-snapshot
On the computational complexity of the secure state-reconstruction problem
inferred← citeshttps://doi.org/10.1016/j.automatica.2023.111454openalex-snapshot
Optimal resilient sensor placement problem for secure state estimation
inferred← citeshttps://doi.org/10.1016/j.dam.2008.04.023openalex-snapshot
Scientific contributions of Leo Khachiyan (a short overview)
inferred← citeshttps://doi.org/10.1016/j.dam.2014.07.028openalex-snapshot
On the tractability of some natural packing, covering and partitioning problems
inferred← citeshttps://doi.org/10.1016/j.dsp.2022.103819openalex-snapshot
Reducing the dimensionality of data using tempered distributions
inferred← citeshttps://doi.org/10.1016/j.laa.2014.02.011openalex-snapshot
Phase retrieval from very few measurements
inferred← citeshttps://doi.org/10.1016/j.sigpro.2024.109828openalex-snapshot
A novel property to modify weighted l1 minimization for improved compressed sensing
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.01.021openalex-snapshot
Sampling-based dimension reduction for subspace approximation with outliers
inferred← citeshttps://doi.org/10.1016/s1570-8659(02)11003-9openalex-snapshot
Linear Programming and Condition Numbers under the Real Number Computation Model
inferred← citeshttps://doi.org/10.1017/9781009093927.004openalex-snapshot
Circuit Imbalance Measures and Linear Programming
inferred← citeshttps://doi.org/10.1017/9781316882177openalex-snapshot
Algorithmic Aspects of Machine Learning
inferred← citeshttps://doi.org/10.1017/9781316882177.001openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1017/9781316882177.002openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1017/9781316882177.003openalex-snapshot
Nonnegative Matrix Factorization
inferred← citeshttps://doi.org/10.1017/9781316882177.004openalex-snapshot
Tensor Decompositions: Algorithms
inferred← citeshttps://doi.org/10.1017/9781316882177.005openalex-snapshot
Tensor Decompositions: Applications
inferred← citeshttps://doi.org/10.1017/9781316882177.006openalex-snapshot
Sparse Recovery
inferred← citeshttps://doi.org/10.1017/9781316882177.007openalex-snapshot
Sparse Coding
inferred← citeshttps://doi.org/10.1017/9781316882177.008openalex-snapshot
Gaussian Mixture Models
inferred← citeshttps://doi.org/10.1017/9781316882177.009openalex-snapshot
Matrix Completion
inferred← citeshttps://doi.org/10.1017/9781316882177.010openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/9781316882177.011openalex-snapshot
Index
inferred← citeshttps://doi.org/10.1017/s0963548302005175openalex-snapshot
Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
inferred← citeshttps://doi.org/10.1038/ncomms5893openalex-snapshot
An exact arithmetic toolbox for a consistent and reproducible structural analysis of metabolic network models
inferred← citeshttps://doi.org/10.1080/15598608.2014.916242openalex-snapshot
Supersaturated Designs With the Maximum Number of Factors for a Given Resolution-Rank
inferred← citeshttps://doi.org/10.1109/18.641542openalex-snapshot
The intractability of computing the minimum distance of a code
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9030047openalex-snapshot
When is the Secure State-Reconstruction Problem Hard?
inferred← citeshttps://doi.org/10.1109/cdc49753.2023.10384211openalex-snapshot
Observability Blocking for Functional Privacy of Linear Dynamic Networks
inferred← citeshttps://doi.org/10.1109/focs.2017.98openalex-snapshot
Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00091openalex-snapshot
Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00065openalex-snapshot
Efficient Certificates of Anti-Concentration Beyond Gaussians
inferred← citeshttps://doi.org/10.1109/tac.2023.3295698openalex-snapshot
Observability Robustness Under Sensor Failures: A Computational Perspective
inferred← citeshttps://doi.org/10.1109/tac.2024.3451216openalex-snapshot
Optimal Security Investment Problem for Secure State Estimation on Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1109/tit.2013.2248414openalex-snapshot
Certifying the Restricted Isometry Property is Hard
inferred← citeshttps://doi.org/10.1109/tit.2013.2290112openalex-snapshot
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
inferred← citeshttps://doi.org/10.1109/tit.2014.2331341openalex-snapshot
Hidden Cliques and the Certification of the Restricted Isometry Property
inferred← citeshttps://doi.org/10.1109/tnse.2025.3618388openalex-snapshot
Observability Blocking for Functional Privacy of Dynamic Networks
inferred← citeshttps://doi.org/10.1137/080725787openalex-snapshot
Proximity of Weighted and Layered Least Squares Solutions
inferred← citeshttps://doi.org/10.1137/1.9781611973730.23openalex-snapshot
On largest volume simplices and sub-determinants
inferred← citeshttps://doi.org/10.1137/17m1160124openalex-snapshot
Sum-of-Squares Optimization without Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/21m142770xopenalex-snapshot
Cardinality Minimization, Constraints, and Regularization: A Survey
inferred← citeshttps://doi.org/10.1137/s0097539797315410openalex-snapshot
New Lower Bounds for Convex Hull Problems in Odd Dimensions
inferred← citeshttps://doi.org/10.1145/2582112.2582163openalex-snapshot
Optimal Geometric Flows via Dual Programs
inferred← citeshttps://doi.org/10.1145/258533.258559openalex-snapshot
Algorithmic complexity in coding theory and the minimum distance problem
inferred← citeshttps://doi.org/10.1145/2746539.2746628openalex-snapshot
Randomized Rounding for the Largest Simplex Problem
inferred← citeshttps://doi.org/10.1145/2897518.2897649openalex-snapshot
Maximizing determinants under partition constraints
inferred← citeshttps://doi.org/10.1145/3055399.3055457openalex-snapshot
Real stable polynomials and matroids: optimization and counting
inferred← citeshttps://doi.org/10.1145/3173127.3173138openalex-snapshot
Computational Geometry Column 66
inferred← citeshttps://doi.org/10.1145/3406325.3451091openalex-snapshot
Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests
inferred← citeshttps://doi.org/10.1145/997817.997859openalex-snapshot
On the least median square problem
inferred← citeshttps://doi.org/10.1287/moor.1050.0164openalex-snapshot
Boundedness Theorems for the Relaxation Method
inferred← citeshttps://doi.org/10.48550/arxiv.0811.3859openalex-snapshot
On the Complexity of Matroid Isomorphism Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1211.1041openalex-snapshot
Algorithms and Hardness for Robust Subspace Recovery
inferred← citeshttps://doi.org/10.48550/arxiv.1407.4999openalex-snapshot
On the tractability of some natural packing, covering and partitioning problems
inferred← citeshttps://doi.org/10.48550/arxiv.1501.01689openalex-snapshot
Sparse Solutions to Nonnegative Linear Systems and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1611.04548openalex-snapshot
Real Stable Polynomials and Matroids: Optimization and Counting
inferred← citeshttps://doi.org/10.48550/arxiv.1904.03275openalex-snapshot
Robust Subspace Recovery with Adversarial Outliers
inferred← citeshttps://doi.org/10.48550/arxiv.2012.03427openalex-snapshot
A Note on John Simplex with Positive Dilation
inferred← citeshttps://doi.org/10.48550/arxiv.2109.04623openalex-snapshot
ReLU Regression with Massart Noise
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.