On the complexity of computing the measure of ∪[a <sub>i</sub> ,b <sub>i</sub> ] (Q4157950): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/cacm/FredmanW78, #quickstatements; #temporary_batch_1731508824982 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/359545.359553 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2077449861 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/cacm/FredmanW78 / rank | |||
Normal rank | |||
Latest revision as of 16:22, 13 November 2024
scientific article; zbMATH DE number 3589729
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of computing the measure of ∪[a <sub>i</sub> ,b <sub>i</sub> ] |
scientific article; zbMATH DE number 3589729 |
Statements
On the complexity of computing the measure of ∪[a <sub>i</sub> ,b <sub>i</sub> ] (English)
0 references
1978
0 references
