Can the catenation of two weakly sparse languages be dense?
type: Item
instance of: scholarly article
title: Can the catenation of two weakly sparse languages be dense?
zbMATH Open document ID: 0644.68102
DOI: 10.1016/0166-218X(88)90083-2
published in: Discrete Applied Mathematics
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 4051032
zbMATH Keywords: weakly sparse languages
zbMATH Keywords: dense language
author: Sheng Yu
MaRDI profile type: Publication
cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets
cites work: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
full work available at URL: 0166-218x(88)90083-2
OpenAlex ID: W2082432017
description: scientific article; zbMATH DE number 4051032