scientific article; zbMATH DE number 3878357

MaRDI QIDQ3343437zbMATH OpenFDO

Authors Ivan Kramosil

Publication date 1983

zbMATH Keywords

algorithmic complexity of binary stringspseudo-random numbersTuring machine

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 953025
• scientific article; zbMATH DE number 4043283
• scientific article; zbMATH DE number 2186130
• An Optimal Algorithm for Monte Carlo Estimation
• Monte Carlo computability

Cited in

(13)

• An analysis of Monte Carlo algorithms for counting problems
• scientific article; zbMATH DE number 2186130 (Why is no real title available?)
• Probabilistic-algebraic algorithms of Monte Carlo methods
• scientific article; zbMATH DE number 3866254 (Why is no real title available?)
• scientific article; zbMATH DE number 4160064 (Why is no real title available?)
• scientific article; zbMATH DE number 4011516 (Why is no real title available?)
• Monte-Carlo approximation algorithms for enumeration problems
• Monte Carlo Simulation of Infinite Series
• Monte Carlo computability
• Computational Complexity Analysis for Monte Carlo Approximations of Classically Scaled Population Processes
• An Optimal Algorithm for Monte Carlo Estimation
• On the Power of Restricted Monte Carlo Algorithms
• Complexity of Multilevel Monte Carlo Tau-Leaping

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3343437)