The complexity of the majority rule on planar graphs (Q2255002): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.aam.2014.11.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981341508 / rank | |||
Normal rank | |||
Revision as of 21:00, 19 March 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
