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

What is the complexity of surface integration?

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

DOI10.1006/jcom.2001.0578zbMath0984.68084OpenAlexW1988966930MaRDI QIDQ5946397

Arthur G. Werschulz, Henryk Woźniakowski

Publication date: 5 May 2002

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

Full work available at URL: https://doi.org/10.1006/jcom.2001.0578

zbMATH Keywords

information-based complexitysurface integration


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)


Related Items

The complexity of Fredholm equations of the second kind: noisy information about everything, What is the complexity of volume calculation?



Cites Work

  • Variational properties of averaged equations for periodic media
  • Deterministic and stochastic error bounds in numerical analysis
  • When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
  • $L^\infty $-Multivariate Approximation Theory
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5946397&oldid=12103080"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 01:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki