Pages that link to "Item:Q1623689"
From MaRDI portal
The following pages link to The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data (Q1623689):
Displaying 6 items.
- A mathematical programming approach to sample coefficient of variation with interval-valued observations (Q286182) (← links)
- EIV regression with bounded errors in data: total `least squares' with Chebyshev norm (Q2175654) (← links)
- Complexity of computing interval matrix powers for special classes of matrices. (Q2216226) (← links)
- Maximization of a PSD quadratic form and factorization (Q2230781) (← links)
- Two optimization problems in linear regression with interval data (Q2970398) (← links)
- The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability (Q6599765) (← links)
