Abstract
In this chapter, we prove the results about computational complexity and feasibility of properties of interval matrices that were formulated in the previous chapter. Along the way, we also describe some important auxiliary results.
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). Properties of Interval Matrices II: Proofs and Auxiliary Results. 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_22
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2793-7_22
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4785-7
Online ISBN: 978-1-4757-2793-7
eBook Packages: Springer Book Archive