Two-Coloring Linked Lists is NC^1-Complete for Logarithmic Space

Sanjeev Saxena. Two-Coloring Linked Lists is NC^1-Complete for Logarithmic Space. Inf. Process. Lett., 49(2):73-76, 1994.

Abstract

Abstract is missing.