加载中…
2001-06-25
Recursively Undecidable Properties of NP
V. G. Naidenko
文献摘要
We show that there cannot be any algorithm that for a given nondeterministic polynomial-time Turing machine determinates whether or not the language recognized by this machine belongs to P
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本