Computational complexity and feasibility of data processing and interval computations (Q1377914): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| (5 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Vladik Ya. Kreinovich / rank | |||
| Property / author | |||
| Property / author: Q1377912 / rank | |||
| Property / author | |||
| Property / author: Patrick Thor Kahl / rank | |||
| Property / author | |||
| Property / author: Vladik Ya. Kreinovich / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Anatoly V. Lakeyev / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Patrick Thor Kahl / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: REDLOG / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: QEPCAD / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Cosy / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 04:08, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity and feasibility of data processing and interval computations |
scientific article |
Statements
Computational complexity and feasibility of data processing and interval computations (English)
0 references
27 January 1998
0 references
