The complexity of the majority rule on planar graphs (Q2255002): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:02, 2 February 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
