Relaxed verification for continuous problems

DOI10.1016/0885-064X(92)90012-ZzbMath0755.65148OpenAlexW1987388421MaRDI QIDQ1194381

Erich Novak, Henryk 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)90012-z

zbMATH Keywords

information-based complexityverification complexitycomputation complexityworst-case setting

Mathematics Subject Classification ID

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

Related Items (6)

Testing nonlinear operators ⋮ Testing linear operators -- an average case study ⋮ Testing linear operators ⋮ Weighted geometric discrepancies and numerical integration on reproducing kernel Hilbert spaces ⋮ Complexity of verification and computation for IBC problems ⋮ Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems

Cites Work

• Complexity of verification and computation for IBC problems

This page was built for publication: Relaxed verification for continuous problems