Abstract
In Chapter 3, we showed that the basic problem of interval computations is NP-hard for polynomials f(x1,..., xn). In this chapter, we describe what happens if we restrict the order of these polynomials.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Kreinovich, V., Lakeyev, A., Rohn, J., Kahl, P. (1998). Basic Problem of Interval Computations for Polynomials of Fixed Order. In: Computational Complexity and Feasibility of Data Processing and Interval Computations. Applied Optimization, vol 10. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2793-7_5
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2793-7_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4785-7
Online ISBN: 978-1-4757-2793-7
eBook Packages: Springer Book Archive