Complexity of verification and computation for IBC problems
From MaRDI portal
Recommendations
- Relaxed verification for continuous problems
- Perspectives on information-based complexity
- Probabilistic setting of information-based complexity
- There exists a problem whose computational complexity is any given function of the information complexity
- Recent developments in information-based complexity
Cites work
- scientific article; zbMATH DE number 3688714 (Why is no real title available?)
- scientific article; zbMATH DE number 3755545 (Why is no real title available?)
- scientific article; zbMATH DE number 44104 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Average case complexity of multivariate integration
- Complexity of approximation with relative error criterion in worst, average, and probabilistic settings
- Gaussian measures in Banach spaces
- Relaxed verification for continuous problems
Cited in
(4)
This page was built for publication: Complexity of verification and computation for IBC problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1194380)