The Round Complexity of Two-Party Random Selection (Q3624376): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 05:55, 5 February 2024

scientific article
Language Label Description Also known as
English
The Round Complexity of Two-Party Random Selection
scientific article

    Statements

    The Round Complexity of Two-Party Random Selection (English)
    0 references
    0 references
    0 references
    0 references
    30 April 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    cryptography
    0 references
    distributed computing
    0 references
    coin flipping
    0 references