On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary (Q2934339)
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: On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary |
scientific article; zbMATH DE number 6379948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary |
scientific article; zbMATH DE number 6379948 |
Statements
On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary (English)
0 references
12 December 2014
0 references
unbounded computing power
0 references
0.89845026
0 references
0.8850014
0 references
0.8572637
0 references
0.84688705
0 references
0.84409505
0 references
0.84395456
0 references
0.8431103
0 references
0.84302473
0 references
