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 条
  • [31] Faster exact solutions for some NP-hard problems
    Drori, L
    Peleg, D
    THEORETICAL COMPUTER SCIENCE, 2002, 287 (02) : 473 - 499
  • [32] Parameterized algorithms of fundamental NP-hard problems: a survey
    Li, Wenjun
    Ding, Yang
    Yang, Yongjie
    Sherratt, R. Simon
    Park, Jong Hyuk
    Wang, Jin
    HUMAN-CENTRIC COMPUTING AND INFORMATION SCIENCES, 2020, 10 (01)
  • [33] Probabilistic solutions to some NP-hard matrix problems
    Vidyasagar, M
    Blondel, VD
    AUTOMATICA, 2001, 37 (09) : 1397 - 1405
  • [34] MATRIX REPRESENTATION AND GRADIENT FLOWS FOR NP-HARD PROBLEMS
    WONG, WS
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1995, 87 (01) : 197 - 220
  • [35] Stochastic Enumeration Method for Counting NP-Hard Problems
    Reuven Rubinstein
    Methodology and Computing in Applied Probability, 2013, 15 : 249 - 291
  • [36] Data-Driven Approximations to NP-Hard Problems
    Milan, Anton
    Rezatofighi, S. Hamid
    Garg, Ravi
    Dick, Anthony
    Reid, Ian
    THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 1453 - 1459
  • [37] Trainyard is NP-Hard
    Almanza, Matteo
    Leucci, Stefano
    Panconesi, Alessandro
    THEORETICAL COMPUTER SCIENCE, 2018, 748 : 66 - 76
  • [38] Many bounded versions of undecidable problems are NP-hard
    Klingler, Andreas
    van der Eyden, Mirte
    Stengele, Sebastian
    Reinhart, Tobias
    De las Cuevas, Gemma
    SCIPOST PHYSICS, 2023, 14 (06):
  • [39] A rapid convergent genetic algorithm for NP-hard problems
    Oren, Liel
    Thirer, Nonel
    ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING FOR MULTI-DOMAIN OPERATIONS APPLICATIONS, 2019, 11006
  • [40] An investigation of the use of local search in NP-hard problems
    Newth, D
    Kirley, M
    Green, DG
    IECON 2000: 26TH ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY, VOLS 1-4: 21ST CENTURY TECHNOLOGIES AND INDUSTRIAL OPPORTUNITIES, 2000, : 2710 - 2715
12345