Computing Exact Bounds on Elements of an Inverse Interval Matrix is NP-Hard

被引：0

作者：

137-223, Lockheed Martin Govt. E., 199 Borton Landing Road, Moorestown, NJ 08057, United States ^{[1
]}

机构：

来源：

Reliab Comput | / 2卷 / 137-142期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[1] Computing Exact Componentwise Bounds on Solutions of Linear Systems with Interval Data is NP-Hard
Rohn, J.
Kreinovich, V.
SIAM Journal on Martix Analysis and Applications, 1995, 16 (02):
[2] COMPUTING EXACT COMPONENTWISE BOUNDS ON SOLUTIONS OF LINEAR-SYSTEMS WITH INTERVAL DATA IS NP-HARD
ROHN, J
KREINOVICH, V
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1995, 16 (02) : 415 - 420
[3] CHECKING BOUNDS ON SOLUTIONS OF LINEAR INTERVAL EQUATIONS IS NP-HARD
ROHN, J
LINEAR ALGEBRA AND ITS APPLICATIONS, 1995, 224 : 589 - 596
[4] Computing the norm ||A||∞,1 is NP-hard
Rohn, J
LINEAR & MULTILINEAR ALGEBRA, 2000, 47 (03): : 195 - 204
[5] Computing the Interleaving Distance is NP-Hard
Håvard Bakke Bjerkevik
Magnus Bakke Botnan
Michael Kerber
Foundations of Computational Mathematics, 2020, 20 : 1237 - 1271
[6] Computing the Interleaving Distance is NP-Hard
Bjerkevik, Havard Bakke
Botnan, Magnus Bakke
Kerber, Michael
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2020, 20 (05) : 1237 - 1271
[7] Linear interval equations: Computing enclosures with bounded relative overestimation is NP-hard
Rohn, J
APPLICATIONS OF INTERVAL COMPUTATIONS, 1996, 3 : 81 - 89
[8] Diagonal matrix scaling is NP-hard
Khachiyan, L
LINEAR ALGEBRA AND ITS APPLICATIONS, 1996, 234 : 173 - 179
[9] Exact algorithms for NP-hard problems: A survey
Woeginger, GJ
COMBINATORIAL OPTIMIZATION - EUREKA, YOU SHRINK: PAPERS DEDICATED TO JACK EDMONDS, 2003, 2570 : 185 - 207
[10] Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
Kreinovich, Vladik
Ferson, Scott
International Journal of Approximate Reasoning, 2006, 41 (03): : 331 - 342

← 1 2 3 4 5 →