COMPLETENESS OF PATH-PROBLEMS VIA LOGICAL REDUCTIONS

被引：5
|
作者：
STEWART, IA
机构：
[1] Department of Computer Science, University College of Swansea, Swansea, SA2 8PP, Singleton Park
来源：
INFORMATION AND COMPUTATION | 1995年 / 121卷 / 01期
关键词：
D O I：
10.1006/inco.1995.1127
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show that some well-known path-problems remain complete for the respective complexity class via quantifier-free projections (these are extremely restricted logical reductions). (C) 1995 Academic Press. Inc.
引用
收藏
页码：123 / 134
页数：12
相关论文
共 50 条
12345