文章基本信息

标题：Managing Editor's Column
本地全文：下载
作者：H. Maurer
期刊名称：Journal of Universal Computer Science
印刷版ISSN：0948-6968
出版年度：1998
卷号：4
期号：8
页码：669
DOI：10.3217/jucs-004-08
出版社：Graz University of Technology and Know-Center
摘要：Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and quasi-linear nondeterminism. We show that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and linear nondeterminism
关键词：P-selectivity; computational complexity