An Unambiguous Class Possessing a Complete Set

An Unambiguous Class Possessing a Complete Set
复制标题

拥有完整集合的明确类

DOI:
--
复制
发表时间:
1997
期刊:
Symposium on Theoretical Aspects of Computer Science
影响因子:
--
通讯作者:
Klaus
Klaus
中科院分区:
--
文献类型:
--
作者:
Klaus

文献摘要

被引文献

相似文献

在这项工作中,一个完整的问题,一个明确的logspace类。这是令人惊讶的,因为无歧义是一个“承诺”或“语义”的概念。这些通常导致类显然没有完整的问题。
In this work a complete problem for an unambiguous logspace class is presented. This is surprising since unambiguity is a ‘promise’ or ‘semantic’ concept. These usually lead to classes apparently without complete problems.