Complexity of verification and computation for IBC problems

DOI10.1016/0885-064X(92)90011-YMaRDI QIDQ1194380zbMATH OpenOpenAlexFDO

Authors H. Woźniakowski

Publication date 27 September 1992

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0885-064x(92)90011-y

zbMATH Keywords

Banach spaceGaussian measureerror toleranceworst case complexitycomplexity of computationinformation-based complexitycomputinglinear continuous functionalverifyingprobabilistic complexity

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) General theory of numerical analysis in abstract spaces (65J05)

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)

• Testing linear operators -- an average case study
• Testing nonlinear operators
• Testing linear operators
• Relaxed verification for continuous problems

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)