Hendrych's NP-hardness conjecture for Bayesian A-optimal design
Statement
Let Bayesian A-optimal design (Bayesian AOD) denote the problem of selecting a subset of design vectors to minimize the regularized trace objective
Hendrych's NP-hardness conjecture. The Bayesian AOD problem is NP-hard. This conjecture is resolved in the source: the paper proves NP-hardness for its regularized A-optimal design problem and notes that this problem is a special case of Bayesian AOD.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.