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 条

[41] NP-hard graph problems and boundary classes of graphs
Alekseev, V. E.
Boliac, R.
Korobitsyn, D. V.
Lozin, V. V.
THEORETICAL COMPUTER SCIENCE, 2007, 389 (1-2) : 219 - 236
[42] An analytical study of NP-hard protein folding problems
Thilagavathi, N.
Amudha, T.
2014 INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING APPLICATIONS (ICICA 2014), 2014, : 184 - 188
[43] Typical performance of approximation algorithms for NP-hard problems
Takabe, Satoshi
Hukushima, Koji
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2016,
[44] SOME POLYNOMIAL AND INTEGER DIVISIBILITY PROBLEMS ARE NP-HARD
PLAISTED, D
SIAM JOURNAL ON COMPUTING, 1978, 7 (04) : 458 - 464
[45] NP-HARD PROBLEMS IN HIERARCHICAL-TREE CLUSTERING
KRIVANEK, M
MORAVEK, J
ACTA INFORMATICA, 1986, 23 (03) : 311 - 323
[46] Stochastic Enumeration Method for Counting NP-Hard Problems
Rubinstein, Reuven
METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY, 2013, 15 (02) : 249 - 291
[47] SOME OBSERVATIONS ON THE PROBABILISTIC ALGORITHMS AND NP-HARD PROBLEMS
KO, KI
INFORMATION PROCESSING LETTERS, 1982, 14 (01) : 39 - 43
[48] The simplest families of polytopes associated with NP-hard problems
A. N. Maksimenko
Doklady Mathematics, 2015, 91 : 53 - 55
[49] Serious Games for NP-hard Problems: Challenges and Insights
Chung, Christina
Matsuoka, Asako
Yang, Yueti
Rubin, Julia
Chechik, Marsha
2016 IEEE/ACM 5TH INTERNATIONAL WORKSHOP ON GAMES AND SOFTWARE ENGINEERING (GAS), 2016, : 29 - 32
[50] Matrix representation and gradient flows for NP-hard problems
J Optim Theory Appl, 1 (197):

← 1 2 3 4 5 →