Abstract
In Chapter 3, we showed that if we consider arbitrary polynomials and arbitrary input intervals, then the corresponding interval computation problem is NP-hard. In the previous chapter, we showed that if we fix polynomials and allow arbitrary intervals, then the problem remains NP-hard. In this chapter, we show that if we instead fix intervals and allow arbitrary polynomials, then the problem also remains intractable.
In terms of data processing, this means that if we fix the data and consider arbitrary data processing algorithms, the basic problem is NP-hard.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
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). Fixed Data, Varying Data Processing Algorithms: Still Intractable. 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_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2793-7_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4785-7
Online ISBN: 978-1-4757-2793-7
eBook Packages: Springer Book Archive