A NATURAL ENCODING SCHEME PROVED PROBABILISTIC POLYNOMIAL COMPLETE

被引：18

作者：

VAZIRANI, UV

VAZIRANI, VV

机构：

来源：

关键词：

D O I：

10.1016/0304-3975(83)90004-X

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：291 / 300

页数：10

共 9 条

[1]

Adleman L., 1978, 19th Annual Symposium on Foundations of Computer Science, P75, DOI 10.1109/SFCS.1978.37

[2]

Adleman L. M., 1979, 20th Annual Symposium of Foundations of Computer Science, P397, DOI 10.1109/SFCS.1979.35

[3]

ADLEMAN LM, 1978, UCBERLM7830 U CAL ME

[4] COMPLEXITY OF MINIMUM INFERENCE OF REGULAR SETS [J].

ANGLUIN, D .

INFORMATION AND CONTROL, 1978, 39 (03) :337-350

[5]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[6]

GILL JT, 1974, 6TH P ACM S THEOR CO, P91

[7]

KOLMOGOROV AN, 1965, PROBAB INFORM TRANSM, V1

[8] STRUCTURE OF POLYNOMIAL TIME REDUCIBILITY [J].

LADNER, RE .

[9]

Levin L.A., 1973, SOV MATH DOKL, V14, P1413