Correlation Complexity

Correlation Complexity is a computational complexity measure that quantifies the minimum amount of shared randomness or prior correlation required between parties to simulate a joint probability distribution in the context of communication protocols without direct interaction.

20

Publications

839

Citations

43

Authors

29

Institutions

Publications per year

2017–2026

5

Authors

43

  1. AW
    Arne Winterhof

    Austrian Academy of Sciences, Austria

    4 publications · 86 citations

    4

    h-index

  2. ZC
    Zhixiong Chen

    Putian University, China

    2 publications · 29 citations

    2

    h-index

  3. SM
    Stefano Mancini

    Università di Camerino, Italy

    2 publications · 41 citations

    2

    h-index

  4. CC
    Carlo Cafaro

    SUNY Polytechnic Institute, United States

    2 publications · 41 citations

    2

    h-index

  5. DG
    Davide Girolami

    University of Nottingham, United Kingdom

    1 publications · 39 citations

    1

    h-index

1–5 of 43

Venues

  1. IEEE Transactions on Information Theory

    3 publications · 147 citations

    3

    h-index

  2. The Science of The Total Environment

    1 publications · 114 citations

    1

    h-index

  3. Periodica Mathematica Hungarica

    1 publications · 48 citations

    1

    h-index

  4. 1

    h-index

  5. Discrete Mathematics and Applications

    1 publications · 19 citations

    1

    h-index

1–5