Efficient simulations by a biased coin

DOI10.1016/0020-0190(95)00171-2zbMath1022.68558OpenAlexW2041764401MaRDI QIDQ1352086

Ryuhei Uehara

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00171-2

zbMATH Keywords

algorithmsrandomized algorithmsprobabilistic Turing machinesbiased coins

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Tree algorithms for unbiased coin tossing with a biased coin
• On determining the irrationality of the mean of a random variable
• On dice and coins: Models of computation for random generation
• Computational Complexity of Probabilistic Turing Machines
• Unbiased Coin Tossing with a Biased Coin
• Computability by Probabilistic Turing Machines

This page was built for publication: Efficient simulations by a biased coin