Can the catenation of two weakly sparse languages be dense?
- 31 July 1988
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 20 (3) , 265-267
- https://doi.org/10.1016/0166-218x(88)90083-2
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Sparse complete sets for NP: Solution of a conjecture of Berman and HartmanisJournal of Computer and System Sciences, 1982
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977