On finding minimal length superstrings (Q1140992): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0022-0000(80)90004-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2036145579 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4138187 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Method for the Construction of Minimum-Redundancy Codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4142699 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The macro model for data compression (Extended Abstract) / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:18, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On finding minimal length superstrings |
scientific article |
Statements
On finding minimal length superstrings (English)
0 references
1980
0 references
minimal length superstrings
0 references
NP-completeness
0 references