Old Web
English
Sign In
Acemap
>
Paper
>
Breaking the $O(\sqrt n)$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party
Breaking the $O(\sqrt n)$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party
2021
Elette Boyle
Ran Cohen
Aarushi Goel
Keywords:
Bit (horse)
Computer science
Byzantine architecture
Discrete mathematics
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]