NON-UNIFORM PROOF SYSTEMS - A NEW FRAMEWORK TO DESCRIBE NON-UNIFORM AND PROBABILISTIC COMPLEXITY CLASSES

被引：0

作者：

KAMPER, J

机构：

来源：

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：193 / 210

页数：18

共 32 条

[1]

Abadi M., 1987, 19TH P ACM STOC, P195

[2]

BABAI L, 1986, UNPUB ARUTHURMERLIN

[3]

Babai Laszlo, 1985, ACM S THEORY COMPUTI, P421, DOI DOI 10.1145/22145.22192

[4]

BALCAZAR JL, 1987, LECT NOTES COMPUT SC, V247, P136

[5] SPARSE SETS, LOWNESS AND HIGHNESS [J].

BALCAZAR, JL ;

BOOK, RV ;

SCHONING, U .

[6]

BALCAZAR JL, 1984, LECT NOTES COMPUT SC, V176, P185

[7] ALTERNATION [J].

CHANDRA, AK ;

KOZEN, DC ;

STOCKMEYER, LJ .

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

GILL, J .

[9]

KAMPER J, 1987, 387 U OLD BER

[10]

KARP R, 1980, 12TH P ACM S THEOR C, P302