The complexity of the majority rule on planar graphs (Q2255002): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.aam.2014.11.005 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AAM.2014.11.005 / rank | |||
Normal rank | |||
Latest revision as of 16:59, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the majority rule on planar graphs |
scientific article |
Statements
The complexity of the majority rule on planar graphs (English)
0 references
6 February 2015
0 references
automata networks
0 references
computational complexity
0 references
majority
0 references
P-completeness
0 references
NC
0 references
planar graph
0 references
