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 条
  • [21] 2 NP-HARD INTERCHANGEABLE TERMINAL PROBLEMS
    SAHNI, S
    WU, SY
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1988, 7 (04) : 467 - 472
  • [22] An Approach to Resolve NP-Hard Problems of Firewalls
    Khoumsi, Ahmed
    Erradi, Mohamed
    Ayache, Meryeme
    Krombi, Wadie
    NETWORKED SYSTEMS, NETYS 2016, 2016, 9944 : 229 - 243
  • [23] A categorical approach to NP-hard optimization problems
    Leal, LAD
    Claudio, DM
    Toscani, LV
    Menezes, PB
    COMPUTER AIDED SYSTEMS THEORY - EUROCAST 2003, 2003, 2809 : 62 - 73
  • [24] Exact algorithms for NP-hard problems: A survey
    Woeginger, GJ
    COMBINATORIAL OPTIMIZATION - EUREKA, YOU SHRINK: PAPERS DEDICATED TO JACK EDMONDS, 2003, 2570 : 185 - 207
  • [25] NP-hard approximation problems in overlapping clustering
    Barthélemy, JP
    Brucker, F
    JOURNAL OF CLASSIFICATION, 2001, 18 (02) : 159 - 183
  • [26] NP-hard approximation problems in overlapping clustering
    Barthélemy J.-P.
    Brucker F.
    Journal of Classification, 2001, 18 (2) : 159 - 183
  • [27] The inapproximability of non NP-hard optimization problems
    Cai, LM
    Juedes, D
    Kanj, I
    ALGORITHMS AND COMPUTATIONS, 1998, 1533 : 437 - 446
  • [28] CLOSENESS OF NP-HARD SETS TO OTHER COMPLEXITY CLASSES
    FU, B
    LI, HZ
    SIAM JOURNAL ON COMPUTING, 1994, 23 (02) : 255 - 260
  • [29] The Simplest Families of Polytopes Associated with NP-Hard Problems
    Maksimenko, A. N.
    DOKLADY MATHEMATICS, 2015, 91 (01) : 53 - 55
  • [30] Solving NP-hard combinatorial problems in the practical sense
    Ibaraki, T
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 1997, 1350 : 1 - 1
12345