METHODS FOR PROVING COMPLETENESS VIA LOGICAL REDUCTIONS

被引：10
|
作者：
STEWART, IA [1 ]
机构：
[1] UNIV NEWCASTLE UPON TYNE, COMP LAB, NEWCASTLE UPON TYNE NE1 7RU, TYNE & WEAR, ENGLAND
来源：
THEORETICAL COMPUTER SCIENCE | 1993年 / 118卷 / 02期
关键词：
D O I：
10.1016/0304-3975(93)90109-7
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we illustrate five different techniques for showing that problems are complete for some complexity class via projection translations (these are extremely weak logical reductions). These techniques would not be available to us if we were to take the traditional view of complexity theory where decision problems are equated with sets of strings instead of sets of finite structures.
引用
收藏
页码：193 / 229
页数：37
相关论文
共 50 条
12345