RELATIONS AMONG MOD-CLASSES

被引：25
|
作者：
HERTRAMPF, U
机构：
[1] Institut für Informatik, Universität Würzburg, D-8700 Würzburg, Am Hubland
来源：
THEORETICAL COMPUTER SCIENCE | 1990年 / 74卷 / 03期
关键词：
3;
D O I：
10.1016/0304-3975(90)90081-R
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Mod-classes are those subclasses of P#P[1] where the deterministic polynomial time computation consists only of checking whether the oracle answer for the input lies in a certain residue class modulo a fixed natural number k. For the so defined classes MODk P we prove that MODk P=MODm P if k and m have the same prime divisors and as a consequence of this MODk P is closed under union for all k. © 1990.
引用
收藏
页码：325 / 328
页数：4
相关论文
共 50 条
12345