MODULE CLASSES AND LOGARITHMIC ADVICE

被引：0

作者：

RAMACHANDRAN, J ^{[1
]}

机构：

[1] OHIO STATE UNIV,COLUMBUS,OH 43210

来源：

INFORMATION PROCESSING LETTERS | 1995年 / 55卷 / 05期

关键词：

COMPUTATIONAL COMPLEXITY; COUNTING CLASSES; ADVICE;

D O I：

10.1016/0020-0190(95)00109-P

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We show that paddable languages in MOD(k)P/log (where k is prime) that are also self-reducible are in MOD(k)P, without advice. This is an extension of similar results for self-reducible paddable sets in P/log by Balcazar and Schoning (1992).

引用

页码：241 / 245

页数：5