Design nonlinear storage scheme: a NP-complete problem

被引：0

|

作者：

Tong, Dong

Fang, Binxing

Hu, Mingzeng

机构：

来源：

Xiaoxing Weixing Jisuanji Xitong/Mini-Micro Systems | 2000年 / 21卷 / 05期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：452 / 454

相关论文

共 50 条

[1] ON ONE NP-COMPLETE PROBLEM
DEMEL, J
DEMLOVA, M
KYBERNETIKA, 1995, 31 (02) : 207 - 211
[2] AN NP-COMPLETE MATCHING PROBLEM
PLAISTED, DA
ZAKS, S
DISCRETE APPLIED MATHEMATICS, 1980, 2 (01) : 65 - 72
[3] The STO problem is NP-complete
Krysta, P
Pacholski, L
JOURNAL OF SYMBOLIC COMPUTATION, 1999, 27 (02) : 207 - 219
[4] A simplified NP-complete MAXSAT problem
Raman, V
Ravikumar, B
Rao, SS
INFORMATION PROCESSING LETTERS, 1998, 65 (01) : 1 - 6
[5] Via minimization problem is NP-complete
Naclerio, Nicholas J., 1604, (38):
[6] The transposition median problem is NP-complete
Bader, Martin
THEORETICAL COMPUTER SCIENCE, 2011, 412 (12-14) : 1099 - 1110
[7] A SIMPLIFIED NP-COMPLETE SATISFIABILITY PROBLEM
TOVEY, CA
DISCRETE APPLIED MATHEMATICS, 1984, 8 (01) : 85 - 89
[8] SOFTWARE CONFIGURATION AN NP-COMPLETE PROBLEM
CALABOUGH, J
DATA BASE, 1988, 19 (02): : 29 - 34
[9] THE VIA MINIMIZATION PROBLEM IS NP-COMPLETE
NACLERIO, NJ
MASUDA, S
NAKAJIMA, K
IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (11) : 1604 - 1608
[10] Attaining success is an NP-complete problem
Hemmady, S
COMPUTER, 1996, 29 (11) : 136 - 136

← 1 2 3 4 5 →