RELATIVIZED QUESTIONS INVOLVING PROBABILISTIC ALGORITHMS

被引：54

作者：

RACKOFF, C

机构：

来源：

关键词：

D O I：

10.1145/322290.322306

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：261 / 268

页数：8

共 14 条

[1]

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

[2]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[3]

Baker T., 1975, SIAM Journal on Computing, V4, P431, DOI 10.1137/0204037

[4]

BAKER T, 1976, 17TH P F COMP SCI, P71

BENNETT, CH ;

GILL, J .

[6] COMPUTATIONAL COMPLEXITY OF PROBABILISTIC TURING MACHINES [J].

GILL, J .

[7]

GILL J, 1976, UNPUB

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

LADNER, RE .

[9] RELATIVIZATION OF QUESTIONS ABOUT LOG SPACE COMPUTABILITY [J].

LADNER, RE ;

LYNCH, NA .

MATHEMATICAL SYSTEMS THEORY, 1976, 10 (01) :19-32

[10] RIEMANNS HYPOTHESIS AND TESTS FOR PRIMALITY [J].

MILLER, GL .