THE NP-COMPLETENESS COLUMN - AN ONGOING GUIDE

被引：17

作者：

JOHNSON, DS ^{[1
]}

机构：

[1] AT&T BELL LABS,MURRAY HILL,NJ 07974

来源：

JOURNAL OF ALGORITHMS | 1985年 / 6卷 / 02期

关键词：

D O I：

10.1016/0196-6774(85)90046-X

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：291 / 305

页数：15

共 32 条

[1]

ADLEMAN LM, 1977, 9TH P ACN S THEOR CO, P151

[2] ON THE UNIQUE SATISFIABILITY PROBLEM [J].

BLASS, A ;

GUREVICH, Y .

INFORMATION AND CONTROL, 1982, 55 (1-3) :80-88

[3] NOTE ON THE COMPLEXITY OF CRYPTOGRAPHY [J].

BRASSARD, G .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (02) :232-233

[4] A TIME-LUCK TRADEOFF IN RELATIVIZED CRYPTOGRAPHY [J].

BRASSARD, G .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1981, 22 (03) :280-311

[5] RELATIVIZED CRYPTOGRAPHY [J].

BRASSARD, G .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (06) :877-894

[6] NEW DIRECTIONS IN CRYPTOGRAPHY [J].

DIFFIE, W ;

HELLMAN, ME .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) :644-654

[7]

EDWARDS K, 1983, UNPUB COMPLEXITY UNI

[8] THE COMPLEXITY OF PROMISE PROBLEMS WITH APPLICATIONS TO PUBLIC-KEY CRYPTOGRAPHY [J].

EVEN, S ;

SELMAN, AL ;

YACOBI, Y .

INFORMATION AND CONTROL, 1984, 61 (02) :159-173

[9]

EVEN S, 1980, LECT NOTES COMPUTER, V85, P195

[10]

GESKE J, UNPUB SIAM J COMPUT

← 1 2 3 4 →