NP-completeness in the gossip monoid (Q4576008)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6902206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness in the gossip monoid |
scientific article; zbMATH DE number 6902206 |
Statements
NP-Completeness in the gossip monoid (English)
0 references
12 July 2018
0 references
gossip
0 references
semigroup theory
0 references
computational complexity
0 references
networks
0 references
0 references
0.7451667189598083
0 references
0.7263877391815186
0 references
0.7241117358207703
0 references
0.7196537852287292
0 references
