Skip to main content
Conference ProceedingsOPEN ACCESS

Randomness in algorithm design

Journal of Physics: Conference Series (2013) 473(1)
DOI: 10.1088/1742-6596/473/1/012014
0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

What is the property that a randomized algorithm really requires for randomness? This article exhibits some topics related to randomization and derandomization in computation, the topics which the author has been concerned with motivated by the above question. © Published under licence by IOP Publishing Ltd.

Cite

CITATION STYLE

APA

Kijima, S. (2013). Randomness in algorithm design. In Journal of Physics: Conference Series (Vol. 473). Institute of Physics Publishing. https://doi.org/10.1088/1742-6596/473/1/012014

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free