Nondeterminism Within P
SIAM Journal on Computing（1991）
摘要
Classes of machines using very limited amounts of nondeterminism are studied. The P=? NP question is related to questions about classes lying within P. Complete sets for these classes are given.
更多查看译文
关键词
NONDETERMINISM,QUASI-LINEAR TIME,COMPUTATIONAL COMPLEXITY
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要