Trade-offs between time, space, cooperation, and communication complexity for CD grammar systems (Q2895769)
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: Trade-offs between time, space, cooperation, and communication complexity for CD grammar systems |
scientific article; zbMATH DE number 6052760
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Trade-offs between time, space, cooperation, and communication complexity for CD grammar systems |
scientific article; zbMATH DE number 6052760 |
Statements
4 July 2012
0 references
\(q\)-fair languages
0 references
Szilard languages
0 references
Turing machines
0 references
cooperation complexity
0 references
communication complexity
0 references
time complexity
0 references
space complexity
0 references
cooperating distributed grammar systems
0 references
Trade-offs between time, space, cooperation, and communication complexity for CD grammar systems (English)
0 references
0.8177392482757568
0 references
0.8165683746337891
0 references