Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space
type: Item
instance of: scholarly article
title: Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space
zbMATH Open document ID: 0793.68079
DOI: 10.1016/0020-0190(94)90030-2
author: Sanjeev Saxena
published in: Information Processing Letters
publication date: 1994-04-04T00:00:00Z
review text: It is shown that the problem of 2-colouring a linked list is complete for deterministic log-space under \(NC^ 1\) reductions.
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 540909
zbMATH Keywords: computational complexity
zbMATH Keywords: parallel algorithms
zbMATH Keywords: connected components
zbMATH Keywords: 2- colouring
zbMATH Keywords: linked list
zbMATH Keywords: \(NC^ 1\)
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)90030-2
OpenAlex ID: W2079048332
cites work: Optimal bounds for decision problems on the CRCW PRAM
cites work: Constant Depth Reducibility
cites work: Q3974857
cites work: Parallel Merge Sort
cites work: Correction: Parallel Merge Sort
cites work: Faster optimal parallel prefix sums and list ranking
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Problems complete for deterministic logarithmic space
cites work: Expressibility and Parallel Complexity
cites work: Erratum and addendum to: parallel computation and conflicts in memory access
cites work: Bounds to Complexities of Networks for Sorting and for Switching
cites work: Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
cites work: Q3817623
cites work: An Efficient Parallel Biconnectivity Algorithm
description: scientific article; zbMATH DE number 540909