Can better sampling measures lower the sample complexity of hyperbolic-cross polynomial approximation, and can sample-complexity estimates be proved for domains that are not…
Statement
Can better sampling measures lower the sample complexity of hyperbolic-cross polynomial approximation, and can sample-complexity estimates be proved for domains that are not unions of rectangles with nonvanishing volume, including triangles, simplices, and spheres?
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.