A faster P solution for the Byzantine agreement problem (Q3067490)
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: A faster P solution for the Byzantine agreement problem |
scientific article; zbMATH DE number 5839847
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster P solution for the Byzantine agreement problem |
scientific article; zbMATH DE number 5839847 |
Statements
A Faster P Solution for the Byzantine Agreement Problem (English)
0 references
21 January 2011
0 references
P systems
0 references
P modules
0 references
Byzantine agreement
0 references
distributed algorithms
0 references
modular design
0 references
0.8673593997955322
0 references
0.7962980270385742
0 references
0.7581470012664795
0 references
0.7552051544189453
0 references
0.7531622052192688
0 references
