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 条

[41] Computing technical capacities in the European entry-exit gas market is NP-hard
Lars Schewe
Martin Schmidt
Johannes Thürauf
Annals of Operations Research, 2020, 295 : 337 - 362
[42] Computing technical capacities in the European entry-exit gas market is NP-hard
Schewe, Lars
Schmidt, Martin
Thuerauf, Johannes
ANNALS OF OPERATIONS RESEARCH, 2020, 295 (01) : 337 - 362
[43] On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
Uma, R. N.
Wein, Joel
Williamson, David P.
THEORETICAL COMPUTER SCIENCE, 2006, 361 (2-3) : 241 - 256
[44] Reconstructing a matrix with a given list of coefficients and prescribed row and column sums is NP-hard
Gerard, Yan
COMBINATORIAL IMAGE ANALYSIS, 2008, 4958 : 363 - 371
[45] THE PARTIAL INVERSE MINIMUM CUT PROBLEM WITH L1-NORM IS STRONGLY NP-HARD
Gassner, Elisabeth
RAIRO-OPERATIONS RESEARCH, 2010, 44 (03) : 241 - 249
[46] COMPUTING CERTAIN ELEMENTS OF INVERSE OF A SPARSE MATRIX
ERISMAN, AM
TINNEY, WF
COMMUNICATIONS OF THE ACM, 1975, 18 (03) : 177 - 179
[47] Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing
Guo, MY
Chang, WL
Ho, MC
Lu, J
Cao, JN
BIOSYSTEMS, 2005, 80 (01) : 71 - 82
[48] Fast and Exact Algorithms for Some NP-Hard 2-Clustering Problems in the One-Dimensional Case
Kel'manov, Alexander
Khandeev, Vladimir
ANALYSIS OF IMAGES, SOCIAL NETWORKS AND TEXTS, AIST 2019, 2019, 11832 : 377 - 387
[49] BOUNDS FOR THE EXACT MATRIX-ELEMENTS FOR RADIATION PROCESSES IN HYDROGENIC ATOMS
MOSES, HE
PROSSER, RT
JOURNAL OF MATHEMATICAL PHYSICS, 1992, 33 (05) : 1878 - 1886
[50] COMBINING NP-HARD REDUCTION TECHNIQUES AND STRONG HEURISTICS IN AN EXACT ALGORITHM FOR THE MAXIMUM-WEIGHT CONNECTED SUBGRAPH PROBLEM
Rehfeld, Daniel
Koch, Thorsten
SIAM JOURNAL ON OPTIMIZATION, 2019, 29 (01) : 369 - 398

← 1 2 3 4 5 →