Improved protocols and hardness results for the two-player cryptogenography problem (Q4598294)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improved protocols and hardness results for the two-player cryptogenography problem |
scientific article; zbMATH DE number 6820339
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved protocols and hardness results for the two-player cryptogenography problem |
scientific article; zbMATH DE number 6820339 |
Statements
19 December 2017
0 references
randomized protocols
0 references
anonymous communication
0 references
computer-aided proofs
0 references
solitaire games
0 references
Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem (English)
0 references
0.8122152090072632
0 references
0.8051847815513611
0 references
0.7149205803871155
0 references
0.7123486995697021
0 references
