Computational complexity and feasibility of data processing and interval computations
type: Item
instance of: scholarly article
title: Computational complexity and feasibility of data processing and interval computations
zbMATH Open document ID: 0945.68077
author: Jiří Rohn
author: Vladik Kreinovich
author: A. V. Lakeyev
author: Patrick Thor Kahl
published in: Applied Optimization
publication date: 1998-01-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68-02
zbMATH DE Number: 1110625
describes a project that uses: REDLOG
describes a project that uses: QEPCAD
describes a project that uses: Cosy
MaRDI profile type: Publication
Recommended article: Computational complexity of relating time points with intervals
Recommended article: Complexity of some linear problems with interval data
Recommended article: Q4885384
Recommended article: The Complexity of Computing the Size of an Interval
Recommended article: Q4535082
Recommended article: Interval Arithmetic and Computational Science: Performance Considerations
Recommended article: Computation and complexity
Recommended article: On the complexity of some data analysis problems
Recommended article: Q4162663
description: scientific article; zbMATH DE number 1110625