Upper bound on the complexity of solving hard renaming (Q5176094)
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: Upper bound on the complexity of solving hard renaming |
scientific article; zbMATH DE number 6410090
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bound on the complexity of solving hard renaming |
scientific article; zbMATH DE number 6410090 |
Statements
Upper bound on the complexity of solving hard renaming (English)
0 references
2 March 2015
0 references
combinatorial topology
0 references
distributed systems
0 references
renaming
0 references
shared memory
0 references
symmetry breaking
0 references
wait-free computation
0 references
