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 Stieltjes integration?

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

DOI10.1006/jcom.2000.0540zbMath0958.68074OpenAlexW2101759796MaRDI QIDQ1578424

Arthur G. Werschulz

Publication date: 19 April 2001

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

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


zbMATH Keywords

information-based complexity


Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)


Related Items

Optimal approximation of stochastic integrals with respect to a homogeneous Poisson process



Cites Work

  • Complexity of multilinear problems in the worst case setting
  • Variational properties of averaged equations for periodic media
  • Stieltjes integration and differential geometry: A model for enzyme recognition, discrimination, and catalysis
  • Recursive distribution method for probabilistic fracture mechanics
  • 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:1578424&oldid=13863546"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 02:50.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki