The complexity of the majority rule on planar graphs (Q2255002)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6399103
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the majority rule on planar graphs |
scientific article; zbMATH DE number 6399103 |
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
0.8130061030387878
0 references
0.7978405356407166
0 references
0.7886844277381897
0 references
0.7698633670806885
0 references
0.7654615640640259
0 references
