On the parameterized intractability of determinant maximization

Cites Work

Determinantal point processes for machine learning
The coincidence approach to stochastic point processes
Exact exponential algorithms.
Which problems have strongly exponential complexity?
Parametrized complexity theory.
Eynard-Mehta theorem, Schur process, and their Pfaffian analogs
Proof verification and the hardness of approximation problems
Probabilistic checking of proofs
On the possibility of faster \textsc{SAT} algorithms
Parameterized algorithms
On the complexity of \(k\)-SAT
Fixed-parameter tractability and completeness II: On completeness for W[1]
On selecting a maximum volume sub-matrix of a matrix and related problems
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
Exponential inapproximability of selecting a maximum volume sub-matrix
On coresets for k-means and k-median clustering
Perturbation Bounds for Matrix Eigenvalues
An efficient tree decomposition method for permanents and mixed discriminants
A tight lower bound for planar multiway cut with fixed number of terminals
Randomized rounding for the largest simplex problem
Largest \(j\)-simplices in \(n\)-polytopes
Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope
An Exact Algorithm for Maximum Entropy Sampling
On largest volume simplices and sub-determinants
Maximizing determinants under partition constraints
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
Losing weight by gaining edges
Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes
Tridiagonal maximum-entropy sampling and tridiagonal masks
On the parameterized intractability of determinant maximization

This page was built for publication: On the parameterized intractability of determinant maximization

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