The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data
type: Item
instance of: scholarly article
title: The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data
zbMATH Open document ID: 1506.62034
author: Michal Černý
author: Milan Hladík
published in: Computational Statistics and Data Analysis
publication date: 2018-11-23T00:00:00Z
Mathematics Subject Classification ID: 62-08
zbMATH DE Number: 6984073
zbMATH Keywords: interval data
zbMATH Keywords: \(t\)-ratio
zbMATH Keywords: computational complexity
zbMATH Keywords: NP-hardness
zbMATH Keywords: inapproximability
zbMATH Keywords: pseudopolynomial algorithms
MaRDI profile type: Publication
full work available at URL: j.csda.2014.06.007
OpenAlex ID: W2082209326
cites work: Q3345690
cites work: Symbolic Data Analysis
cites work: On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data
cites work: Credal ensembles of classifiers
cites work: Exact bounds on finite populations of interval data
cites work: Computation of bounds on population parameters when the data are incomplete
cites work: Why intervals? A simple limit theorem that is similar to limit theorems from statistics
cites work: Outlier detection under interval uncertainty: algorithmic solvability and computational complexity
cites work: Q3509193
cites work: Q4286756
cites work: Stochastic dominance with imprecise information
cites work: Introduction to Interval Analysis
cites work: Derived eigenvalues of symmetric matrices, with applications to distance geometry
cites work: Computing statistics under interval and fuzzy uncertainty. Applications to computer science and engineering
cites work: Partial identification of spread parameters
cites work: Q3137900
DOI: 10.1016/J.CSDA.2014.06.007
description: scientific article; zbMATH DE number 6984073