scientific article; zbMATH DE number 3870594

MaRDI QIDQ3336692zbMATH OpenFDO

Authors Marius Zimand

Publication date 1983

zbMATH Keywords

probabilistic algorithmspeed-up process

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Randomized complexity
• A relation between correctness and randomness in the computation of probabilistic algorithms
• scientific article; zbMATH DE number 4030991
• scientific article; zbMATH DE number 4068261
• scientific article; zbMATH DE number 4113619

Cited in

(9)

• scientific article; zbMATH DE number 7204268 (Why is no real title available?)
• scientific article; zbMATH DE number 1246226 (Why is no real title available?)
• Probabilistic Recursion Theory and Implicit Computational Complexity
• scientific article; zbMATH DE number 176067 (Why is no real title available?)
• Relativized questions involving probabilistic algorithms
• On the relation between descriptional complexity and algorithmic probability
• A linear-time algorithm for computing the multinomial stochastic complexity
• Algorithms for imprecise probabilities
• scientific article; zbMATH DE number 3909744 (Why is no real title available?)

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 Q3336692)