scientific article; zbMATH DE number 3870594

zbMATH Open0546.68030MaRDI QIDQ3336692FDOQ3336692

Authors: Marius Zimand 

Publication date: 1983

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

probabilistic algorithmspeed-up process

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Probabilistic Recursion Theory and Implicit Computational Complexity
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

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)