Randomness Efficiency

Randomness Efficiency is a computational complexity metric that quantifies the minimal amount of random bits required by a randomized algorithm to achieve a desired level of accuracy or success probability, distinguishing it from related efficiency measures by focusing specifically on the consumption of randomness as a computational resource.

23

Publications

912

Citations

80

Authors

51

Institutions

Publications per year

2017–2026

9

Authors

80

  1. LS
    Loïc Siéler

    Laboratoire de Conception, Optimisation et Modélisation des Systèmes, France

    1 publications · 20 citations

    1

    h-index

  2. AS
    Ahmed Sidi El Valli

    Université Grenoble Alpes, France

    1 publications · 21 citations

    1

    h-index

  3. YY
    Yongguang Yu

    Beijing Jiaotong University, China

    1 publications · 39 citations

    1

    h-index

  4. CU
    Christopher Umans

    California Institute of Technology, United States

    1 publications · 13 citations

    1

    h-index

  5. AT
    Amnon Ta‐Shma

    Tel Aviv University, Israel

    1 publications · 13 citations

    1

    h-index

1–5 of 80

Venues

  1. Review of Scientific Instruments

    2 publications · 211 citations

    2

    h-index

  2. Mathematics

    2 publications · 132 citations

    2

    h-index

  3. Microsystem Technologies

    1 publications · 58 citations

    1

    h-index

  4. Journal of Applied Physics

    1 publications · 44 citations

    1

    h-index

  5. Physical Review Applied

    1 publications · 21 citations

    1

    h-index

1–5