arrogant504
这家伙很懒，什么也没写
Ta上传的资源 (0)
The Complexity of Theorem Proving Procedures
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determ