Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Complexity of verification and computation for IBC problems

From MaRDI portal
Publication:1194380
Jump to:navigation, search

DOI10.1016/0885-064X(92)90011-YzbMath0755.65149OpenAlexW2133277606MaRDI QIDQ1194380

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)90011-y


zbMATH Keywords

Banach spaceinformation-based complexityGaussian measureworst case complexityerror tolerancecomplexity of computationcomputinglinear continuous functionalverifyingprobabilistic complexity


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 (4)

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



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Complexity of approximation with relative error criterion in worst, average, and probabilistic settings
  • Relaxed verification for continuous problems
  • Gaussian measures in Banach spaces
  • Average case complexity of multivariate integration


This page was built for publication: Complexity of verification and computation for IBC problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1194380&oldid=13257702"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 06:47.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki