P-complete problems in data compression
type: Item
instance of: scholarly article
title: P-complete problems in data compression
zbMATH Open document ID: 0805.68058
DOI: 10.1016/0304-3975(94)90106-6
author: Sergio De Agostino
published in: Theoretical Computer Science
publication date: 1995-01-26T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68P20
zbMATH DE Number: 567722
zbMATH Keywords: data compression
zbMATH Keywords: parallel computational complexity
zbMATH Keywords: parallelization
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90106-6
OpenAlex ID: W2071779672
cites work: Efficient parallel algorithms to test square-freeness and factorize strings
cites work: Q3694726
cites work: On the Complexity of Finite Sequences
cites work: A universal algorithm for sequential data compression
cites work: Data compression via textual substitution
cites work: Compression of individual sequences via variable-rate coding
description: scientific article; zbMATH DE number 567722