NP-COMPLETE PROBLEMS SIMPLIFIED ON TREE SCHEMAS

被引：0
|
作者：
GOODMAN, N
SHMUELI, O
机构：
来源：
ACTA INFORMATICA | 1983年 / 20卷 / 02期
关键词：
D O I：
10.1007/BF00289414
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：171 / 178
页数：8
相关论文
共 50 条
  • [21] Neural networks for NP-complete problems
    Budinich, M
    NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 1997, 30 (03) : 1617 - 1624
  • [22] On Some NP-complete SEFE Problems
    Angelini, Patrizio
    Da Lozzo, Giordano
    Neuwirth, Daniel
    ALGORITHMS AND COMPUTATION, WALCOM 2014, 2014, 8344 : 200 - 212
  • [23] Generic complexity of NP-complete problems
    GROUP-BASED CRYPTOGRAPHY, 2008, : 129 - 134
  • [24] INFEASIBLE COMPUTATION - NP-COMPLETE PROBLEMS
    LAMAGNA, EA
    ABACUS-NEW YORK, 1987, 4 (03): : 18 - 33
  • [25] RECTILINEAR STEINER TREE PROBLEM IS NP-COMPLETE
    GAREY, MR
    JOHNSON, DS
    SIAM JOURNAL ON APPLIED MATHEMATICS, 1977, 32 (04) : 826 - 834
  • [26] OPTP AS THE NORMAL BEHAVIOR OF NP-COMPLETE PROBLEMS
    GASARCH, WI
    KRENTEL, MW
    RAPPOPORT, KJ
    MATHEMATICAL SYSTEMS THEORY, 1995, 28 (06): : 487 - 514
  • [27] DNA models and algorithms for NP-complete problems
    Bach, E
    Condon, A
    Glaser, E
    Tanguay, C
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1998, 57 (02) : 172 - 186
  • [28] ON CHAOTIC BEHAVIOR OF SOME NP-COMPLETE PROBLEMS
    PERL, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 314 : 149 - 161
  • [29] SAT Oracles, for NP-Complete Problems and Beyond
    Le Berre, Daniel
    SPLC'19: PROCEEDINGS OF THE 23RD INTERNATIONAL SYSTEMS AND SOFTWARE PRODUCT LINE CONFERENCE, VOL A, 2020, : XXII - XXII
  • [30] Solving NP-Complete problems with quantum search
    Furer, Martin
    LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 784 - 792
12345