Breaking the <i>O</i> ( <i>n</i> <sup>2</sup> ) bit barrier (Q5176217): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:51, 8 February 2024
scientific article; zbMATH DE number 6410445
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Breaking the <i>O</i> ( <i>n</i> <sup>2</sup> ) bit barrier |
scientific article; zbMATH DE number 6410445 |
Statements
Breaking the <i>O</i> ( <i>n</i> <sup>2</sup> ) bit barrier (English)
0 references
2 March 2015
0 references
Byzantine agreement
0 references
consensus
0 references
distributed computing
0 references
Monte Carlo algorithms
0 references
peer-to-peer
0 references
samplers
0 references
secret-sharing
0 references
