Publisher
Springer International Publishing
Reference12 articles.
1. S. Ferson, L. Ginzburg, V. Kreinovich, L. Longpré, M. Aviles, Computing variance for interval data is NP-hard. SIGACT News 33(2), 108–118 (2002)
2. A. Gaganov, Computation Complexity of the Range of a Polynomial in Several Variables. Leningrad University, Math. Department. M.S. Thesis (1981)
3. A. Gaganov, Computation complexity of the range of a polynomial in several variables. Cybernetics 21, 418–421 (1985)
4. D. Grigor’ev, N. Vorobjov, Solving systems of polynomial inequalities in subexponential time. J. Symb. Comput. 5(1–2), 37–64 (1988)
5. A. Kawamura, S. Cook, Complexity theory for operators in analysis. ACM Trans. Comput. Theory 4(2), 24 (2012)