A hierarchy for nondeterministic time complexity
作者：
Highlights：
•
摘要
We prove the following theorem in this paper: For any real numbers r1, r2, 1≤r1
论文关键词：
论文评审过程：Received 11 July 1972, Available online 27 December 2007.
论文官网地址：https://doi.org/10.1016/S0022-0000(73)80028-5
