Can the catenation of two weakly sparse languages be dense? (Q1102760): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q418765 |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Sheng Yu / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(88)90083-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082432017 / rank | |||
Normal rank | |||
Latest revision as of 10:23, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Can the catenation of two weakly sparse languages be dense? |
scientific article |
Statements
Can the catenation of two weakly sparse languages be dense? (English)
0 references
1988
0 references
weakly sparse languages
0 references
dense language
0 references
