ON THE COMPLEXITY OF TEST CASE GENERATION FOR NP-HARD PROBLEMS

被引：12

|

作者：

SANCHIS, LA ^{[1
]}

机构：

[1] UNIV ROCHESTER,DEPT COMP SCI,ROCHESTER,NY 14627

来源：

INFORMATION PROCESSING LETTERS | 1990年 / 36卷 / 03期

关键词：

approximation algorithms; Computational complexity; generation; NP-completeness; test cases;

D O I：

10.1016/0020-0190(90)90082-9

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

收藏

页码：135 / 140

页数：6

相关论文

共 50 条

[1] ALGORITHMIC COMPLEXITY - 3 NP-HARD PROBLEMS IN COMPUTATIONAL STATISTICS
WELCH, WJ
JOURNAL OF STATISTICAL COMPUTATION AND SIMULATION, 1982, 15 (01) : 17 - 25
[2] GENERATING HARD AND DIVERSE TEST SETS FOR NP-HARD GRAPH PROBLEMS
SANCHIS, LA
DISCRETE APPLIED MATHEMATICS, 1995, 58 (01) : 35 - 66
[3] Studying the complexity of global verification for NP-hard discrete optimization problems
Armstrong, DE
Jacobson, SH
JOURNAL OF GLOBAL OPTIMIZATION, 2003, 27 (01) : 83 - 96
[4] Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems
Derek E. Armstrong
Sheldon H. Jacobson
Journal of Global Optimization, 2003, 27 : 83 - 96
[5] A fuzzy system for multiobjective problems - A case study in NP-hard problems
Gholamian, MR
Ghomi, SMTF
Ghazanfari, M
ARTIFICIAL INTELLIGENCE APPLICATIONS AND INNOVATIONS II, 2005, 187 : 1 - 13
[6] Most Tensor Problems Are NP-Hard
Hillar, Christopher J.
Lim, Lek-Heng
JOURNAL OF THE ACM, 2013, 60 (06)
[7] DECOMPOSITION OF ARITHMETICAL NP-HARD PROBLEMS
MEJZLIK, P
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1993, 48 (1-2) : 31 - 38
[8] A hybrid system for multiobjective problems - A case study in NP-hard problems
Gholamian, M. R.
Ghomi, S. M. T. Fatemi
Ghazanfari, M.
KNOWLEDGE-BASED SYSTEMS, 2007, 20 (04) : 426 - 436
[9] Dynamic Programming for NP-Hard Problems
Wang, Xiaodong
Tian, Jun
CEIS 2011, 2011, 15
[10] POLYNOMIAL BOUNDING FOR NP-HARD PROBLEMS
CAMERINI, PM
MAFFIOLI, F
MATHEMATICAL PROGRAMMING STUDY, 1980, 12 (APR): : 115 - 119

← 1 2 3 4 5 →