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

Complexity of monotone modelling algorithms for discrete distributions

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

zbMath0783.65095MaRDI QIDQ1204951

B. B. Pokhodzej

Publication date: 1 April 1993

Published in: Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)


zbMATH Keywords

complexitysimulationrandom variablesdiscrete monotone methodfinite discrete distributionsinvert methodnon-monotone algorithmsoptimal monotone algorithms


Mathematics Subject Classification ID

Approximations to statistical distributions (nonasymptotic) (62E17) Complexity and performance of numerical algorithms (65Y20) Probabilistic methods, stochastic differential equations (65C99)








This page was built for publication: Complexity of monotone modelling algorithms for discrete distributions

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