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 条

[1] A simplified NP-complete MAXSAT problem
Raman, V
Ravikumar, B
Rao, SS
INFORMATION PROCESSING LETTERS, 1998, 65 (01) : 1 - 6
[2] A SIMPLIFIED NP-COMPLETE SATISFIABILITY PROBLEM
TOVEY, CA
DISCRETE APPLIED MATHEMATICS, 1984, 8 (01) : 85 - 89
[3] NP-COMPLETE SCHEDULING PROBLEMS
ULLMAN, JD
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1975, 10 (03) : 384 - 393
[4] Entropy for NP-complete problems
Levchenkov, V.S.
Doklady Akademii Nauk, 2001, 376 (02) : 175 - 178
[5] The entropy of NP-complete problems
Levchenkov, VS
DOKLADY MATHEMATICS, 2001, 63 (01) : 130 - 132
[6] Decidability of NP-Complete Problems
A. A. Vagis
A. M. Gupal
Cybernetics and Systems Analysis, 2022, 58 : 914 - 916
[7] Decidability of NP-Complete Problems
Vagis, A. A.
Gupal, A. M.
CYBERNETICS AND SYSTEMS ANALYSIS, 2022, 58 (06) : 914 - 916
[8] Universal solutions for NP-complete problems
Portier, N
THEORETICAL COMPUTER SCIENCE, 1998, 201 (1-2) : 137 - 150
[9] New NP-complete partition problems
Saeednia, S
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (07) : 2092 - 2094
[10] A LINEAR CHARACTERIZATION OF NP-COMPLETE PROBLEMS
URSIC, S
LECTURE NOTES IN COMPUTER SCIENCE, 1984, 170 : 80 - 100

← 1 2 3 4 5 →