On the parameterized intractability of determinant maximization

Cites work

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

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)