Round Complexity of Common Randomness Generation: The Amortized Setting

doi 10.1137/1.9781611975994.66
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Amortized Communication Complexity

English

On the Amortized Complexity of Zero-Knowledge Protocols

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Randomness in the Higher Setting

Journal of Symbolic Logic
PhilosophyLogic
2015English

Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation

2019English

An Amortized-Complexity Method to Compute the Riemann Zeta Function

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2011English

The Arithmetical Complexity of Dimension and Randomness

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Kolmogorov Complexity and Algorithmic Randomness

Mathematical Surveys and Monographs
2017English

Another Motivation for Reducing the Randomness Complexity of Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Resource-Efficient Common Randomness and Secret-Key Schemes

2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy