Deterministic versus nondeterministic time and lower bound problems

被引:3
|
作者
Stearns, RE [1 ]
机构
[1] SUNY Albany, Dept Comp Sci, Albany, NY 12222 USA
关键词
theory; algorithms; computational complexity; generic algorithms; generic problems; nondeterminism; NP-completeness; power index; SAT; time complexity;
D O I
10.1145/602382.602409
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:91 / 95
页数:5
相关论文
共 50 条