Resumen
We study the complexity of linear problems in mixed settings. We prove that the complexity of a mixed setting depends primarily on how the algorithm error is defined. That is, the worst error-average cost and worst error-worst cost complexities are essentially the same, as are the average error-worst cost and average error-average cost complexities.
| Idioma original | English |
|---|---|
| Páginas (desde-hasta) | 457-465 |
| Número de páginas | 9 |
| Publicación | Journal of Complexity |
| Volumen | 5 |
| N.º | 4 |
| DOI | |
| Estado | Published - dic 1989 |
Nota bibliográfica
Funding Information:* Research partially supported by the National Science Foundation under Grant CCR-86 03674. t Research partially supported by the National Science Foundation under Grant ICT-85-17289.
Financiación
* Research partially supported by the National Science Foundation under Grant CCR-86 03674. t Research partially supported by the National Science Foundation under Grant ICT-85-17289.
| Financiadores | Número del financiador |
|---|---|
| National Science Foundation Arctic Social Science Program | ICT-85-17289, CCR-86 03674, 8517289 |
ASJC Scopus subject areas
- Algebra and Number Theory
- Statistics and Probability
- Numerical Analysis
- General Mathematics
- Control and Optimization
- Applied Mathematics
Huella
Profundice en los temas de investigación de 'Mixed settings for linear problems'. En conjunto forman una huella única.Citar esto
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver