Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space (Q1318772)
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 540909
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space |
scientific article; zbMATH DE number 540909 |
Statements
Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space (English)
0 references
4 April 1994
0 references
It is shown that the problem of 2-colouring a linked list is complete for deterministic log-space under \(NC^ 1\) reductions.
0 references
computational complexity
0 references
parallel algorithms
0 references
connected components
0 references
2- colouring
0 references
linked list
0 references
\(NC^ 1\)
0 references
