For a given interval matrix, it would be valuable to have a practical method for determining the family of matrices which are inverses of its members. Since the exact family of inverse matrices can be difficult to find or to describe, effort is often applied to developing methods for determining matrix families with interval structure which "best" approximate or contain it. A common approach is to seek exact bounds on individual elements. In this paper, we show that computing exact bounds is NP-hard; therefore any algorithm will have at least exponential-time worst-case computational cost unless P = NP.
Reliable Computing – Springer Journals
Published: Sep 30, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.
All for just $49/month
Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.
Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.
It’s easy to organize your research with our built-in tools.
Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera