The complexity of the majority rule on planar graphs (Q2255002): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An ${\mathcal{N} \mathcal{C}}$ Algorithm for Evaluating Monotone Planar Circuits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of the bootstraping percolation and other problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decreasing energy functions as a tool for studying threshold networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4843270 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Majority-vote cellular automata, Ising dynamics, and \(\mathbf P\)-completeness / rank | |||
Normal rank | |||
Revision as of 15:51, 9 July 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
